System and method for two-dimensional equalization in an orthogonal time frequency space communication system

ABSTRACT

A system and method for receiving communication signals that have been spread in two dimensions. The method includes receiving signals representative of data that has been two-dimensionally spread and transmitted over a communication channel. The method further includes processing the signals to determine equalization coefficients based upon a two-dimensional time-frequency impulse response of the communication channel. A two-dimensional signal equalization procedure is then performed using the equalization coefficients.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application claims the benefit of priority under 35 U.S.C. § 119(e) of U.S. Provisional Application No. 62/215,156, entitled ORTHOGONAL TIME FREQUENCY SPACE COMMUNICATION SYSTEM AND METHOD, filed Sep. 7, 2015, of U.S. Provisional Application No. 62/215,127, entitled ORTHOGONAL TIME FREQUENCY SPACE A Novel Modulation Technique Address the Challenges of 5G Networks, filed Sep. 7, 2015, and of U.S. Provisional Application No. 62/215,663, entitled ORTHOGONAL TIME FREQUENCY SPACE COMMUNICATION SYSTEM AND METHOD, filed Sep. 8, 2015, the contents of each of which are hereby incorporated by reference in their entirety for all purposes. The present application is a continuation-in-part of U.S. patent application Ser. No. 14/709,377, entitled MODULATION AND EQUALIZATION IN AN ORTHONORMAL TIME-FREQUENCY SHIFTING COMMUNICATIONS SYSTEM, filed May 11, 2015, which is a continuation of U.S. patent application Ser. No. 13/927,086, entitled MODULATION AND EQUALIZATION IN AN ORTHONORMAL TIME-FREQUENCY SHIFTING COMMUNICATIONS SYSTEM, filed on Jun. 25, 2013, which claims the benefit of priority under 35 U.S.C. §119(e) of U.S. Provisional Application Ser. No. 61/664,020, entitled MODULATION AND EQUALIZATION IN AN ORTHONORMAL TIME-FREQUENCY SHIFTING COMMUNICATIONS SYSTEM, filed Jun. 25, 2012, of U.S. Provisional Application Ser. No. 61/801,398, entitled MODULATION AND EQUALIZATION IN AN ORTHONORMAL TIME-FREQUENCY SHIFTING COMMUNICATIONS SYSTEM, filed Mar. 15, 2013, of U.S. Provisional Application Ser. No. 61/801,366, entitled MODULATION AND EQUALIZATION IN AN ORTHONORMAL TIME-FREQUENCY SHIFTING COMMUNICATIONS SYSTEM, filed Mar. 15, 2013, of U.S. Provisional Application Ser. No. 61/801,435, entitled MODULATION AND EQUALIZATION IN AN ORTHONORMAL TIME-FREQUENCY SHIFTING COMMUNICATIONS SYSTEM, filed Mar. 15, 2013, of U.S. Provisional Application Ser. No. 61/801,495, entitled MODULATION AND EQUALIZATION IN AN ORTHONORMAL TIME-FREQUENCY SHIFTING COMMUNICATIONS SYSTEM, filed Mar. 15, 2013, of U.S. Provisional Application Ser. No. 61/801,994, entitled MODULATION AND EQUALIZATION IN AN ORTHONORMAL TIME-FREQUENCY SHIFTING COMMUNICATIONS SYSTEM, filed Mar. 15, 2013, and of U.S. Provisional Application Ser. No. 61/801,968, entitled MODULATION AND EQUALIZATION IN AN ORTHONORMAL TIME-FREQUENCY SHIFTING COMMUNICATIONS SYSTEM, filed Mar. 15, 2013, the contents of each of which are hereby incorporated by reference in their entirety for all purposes.

FIELD

This disclosure generally relates to communications protocols and methods, and more particularly relates to methods for modulation and related processing of signals used for wireless and other forms of communication.

BACKGROUND

Fourth generation (4G) wireless networks have served the public well, providing ubiquitous access to the Internet and enabling the explosion of mobile apps, smartphones and sophisticated data intensive applications like mobile video. This continues the evolution of cellular technologies, where each new generation brings substantial benefits to the public, enabling significant gains in productivity, convenience, and quality of life.

Looking ahead to the demands that the ever increasing and diverse data usage is placing on existing networks, it is becoming clear to the industry that current 4G networks will not be able to support the foreseen needs in data usage. This is in part because data traffic volume has been, and continues to, increase at an exponential rate. Moreover, new applications such as, for example, immersive reality and remote robotic operation, coupled with the ongoing expansion of mobile video, are expected to overwhelm the carrying capacity of current network systems. One of the goals of 5G system design is to be able to economically scale the capabilities of networks in dense urban settings (e.g., to 750 Gbps per sq. Km), which is not possible using technology which has been commercially deployed.

In addition to being able to handle larger volumes of data, next generation systems will need to improve the quality of data delivery in order to support desired future applications. The public is increasingly coming to expect that wireless networks provide a near “wireline” experience to the untethered user. This may translate to, for example, a requirement of 50+ Mbps throughout coverage areas (i.e., even at cell edges), which will require advanced interference mitigation technologies to be realized.

Another aspect of the quality of user experience is mobility. The throughput of current wireless networks tends to be dramatically reduced in tandem with increased mobile speeds due to Doppler effects. Future 5G systems aim to not only increase supported speeds up to 500 Km/h for high speed trains and aviation, but to also support a host of new automotive applications for vehicle-to-vehicle and vehicle-to-infrastructure communications.

While the support of increased and higher quality data traffic is necessary for wireless networks to continue supporting user needs, carriers are also exploring new applications that will enable new revenues and innovative use cases. These include the automotive and smart infrastructure applications discussed above. Other desired applications include the deployment of public safety ultra-reliable networks, the use of cellular networks to support the sunset of the PSTN, and the like. Moreover, it is anticipated the 5G networks will usher in the deployment of large numbers of Internet connected devices, also known as the Internet of Things (IoT). However, existing networks are not designed to support a very large number of connected devices with very low traffic per device.

SUMMARY

In one aspect the disclosure relates to a communication device including an antenna and a receiver configured to receive, from the antenna, signals representative of data that has been two-dimensionally spread and transmitted over a communication channel. The receiver processes the signals to determine equalization coefficients based upon a two-dimensional time-frequency impulse response of the communication channel. The receiver also performs a two-dimensional signal equalization procedure using the equalization coefficients.

In another aspect the disclosure relates to a method of receiving communication signals. The method includes receiving signals representative of data that has been two-dimensionally spread and transmitted over a communication channel. The method further includes processing the signals to determine equalization coefficients based upon a two-dimensional time-frequency impulse response of the communication channel. A two-dimensional signal equalization procedure is then performed using the equalization coefficients.

The disclosure is also directed to a communication device including an antenna arrangement and a transmitter. The transmitter is configured to receive a stream of input data and generate two-dimensionally pre-equalized data by pre-equalizing the input data in accordance with corrective information relating to echo reflections and frequency shifts present within a communication channel. The transmitter is further configured to transmit the pre-equalized data.

The disclosure also pertains to a communication device including an antenna and a receiver. The receiver is configured to receive, from the antenna, signals representative of data that has been two-dimensionally spread and transmitted over a communication channel. The receiver is further configured to process the signals to determine equalization coefficients based upon a two-dimensional time-frequency impulse response of the communication channel. A two-dimensional signal equalization procedure is then performed by the receiver using the equalization coefficients.

In another aspect the disclosure relates to a method of receiving communication signals. The method includes receiving signals representative of data that has been two-dimensionally spread and transmitted over a communication channel and processing the signals to determine equalization coefficients based upon a two-dimensional time-frequency impulse response of the communication channel. The method further includes performing a two-dimensional signal equalization procedure using the equalization coefficients.

In a further aspect the disclosure is directed to a method of providing a modulated signal useable in a signal transmission system. The method includes transforming a data frame including a plurality of data elements into a two-dimensionally spread data matrix by performing a spreading operation wherein the spread data matrix includes at least N rows and at least M columns, where N and M are greater than one. Each of the at least N rows of the spread data matrix are filtered using a filter bank. The modulated signal is then generated in accordance with results of the filtering.

In another aspect the disclosure relates to a method of generating a waveform for transmission over a communication channel. The method includes receiving a plurality of information symbols and creating a plurality of modulation symbols by using each of the plurality information symbols to modulate one of a plurality of two-dimensional basis functions on a time-frequency plane Each of the plurality of two-dimensional basis functions is uniquely associated with one of the plurality of information symbols. The method further includes generating a transmit waveform comprised of a plurality of pulse waveforms, each of the plurality of puke waveforms corresponding to a combination of one of the plurality of modulation symbols and one of a plurality of time-translated and frequency-modulated versions of a fundamental transmit pulse.

In one implementation each of the plurality of time-translated and frequency-modulated versions of the fundamental transmit pulse is associated with a time translation by one of N multiples of T and a frequency modulation by one of M multiples of Δf, where the transmit waveform is of a total duration of NT seconds and a total bandwidth of MΔf Hz. The fundamental transmit pulse may have the property of being orthogonal to translations by a multiple of time T and modulation by a multiple of Δf.

In another aspect the disclosure relates to a communication device including a wireless transmitter, a processor and a memory including program code executable by the processor. The program code includes code for causing the processor to receive a plurality of information symbols. The program code further includes code for causing the processor to create a plurality of modulation symbols by using each of the plurality information symbols to modulate one of a plurality of two-dimensional basis functions on a time-frequency plane. Each of the plurality of two-dimensional basis functions is uniquely associated with one of the plurality of information symbols. The program code further causes the processor to generate a transmit waveform comprised of a plurality of pulse waveforms, each of the plurality of pulse waveforms corresponding to a combination of one of the plurality of modulation symbols and one of a plurality of time-translated and frequency-modulated versions of a fundamental transmit pulse. The program code further includes code for causing the processor to provide the transmit waveform to the wireless transmitter.

The disclosure is also directed to a method for receiving, at a communication receiver, one or more modulated waveforms. The method further includes performing matched filtering of samples of the one or more modulated waveforms with respect to a receive pulse to produce estimated time-frequency modulation symbols. Each of the estimated tune-frequency modulation symbols corresponds to modulation of one of a plurality of orthogonal two-dimensional basis functions by one of a plurality of information symbols. The method further includes projecting the estimates of the time-frequency modulation symbols on the plurality of orthogonal two-dimensional basis functions in order to obtain estimates of the plurality of information symbols.

In one implementation the method may further include performing windowing and periodization operations with respect to the estimated time-frequency modulation symbols. In addition, the projecting operation may include performing a symplectic Fourier transform operation with respect to a periodic sequence comprised of the estimates of the time-frequency modulation symbols.

In yet another aspect the disclosure pertains to a communication device including a wireless receiver configured to receive one or more modulated waveforms, a processor and a memory including program code executable by the processor. The program code includes code for causing the processor to receive, from the wireless receiver, samples of one or more modulated waveforms. The code further includes code for causing the processor to matched filter samples of the one or more modulated waveforms with respect to a receive pulse to produce estimated time-frequency modulation symbols. Each of the estimated time-frequency modulation symbols corresponds to modulation of one of a plurality of orthogonal two-dimensional basis functions by one of a plurality of information symbols. The program code further includes code for causing the processor to project the estimated time-frequency modulation symbols on the plurality of orthogonal two-dimensional basis functions in order to obtain estimates of the plurality of information symbols.

In one implementation the program code may further include code for performing windowing and periodization operations with respect to the estimated time-frequency modulation symbols. In addition, the code may include code for causing the processor to perform a symplectic Fourier transform operation with respect to a periodic sequence comprised of the estimated time-frequency modulation symbols.

BRIEF DESCRIPTION OF THE DRAWINGS

For a better understanding of the nature and objects of various embodiments of the invention, reference should be made to the following detailed description taken in conjunction with the accompanying drawings, wherein:

FIG. 1A illustrates an example of a wireless communication system that may exhibit time/frequency selective fading.

FIG. 1B provides a high-level representation of a conventional transceiver which could be utilized in the wireless communication system of FIG. 1A.

FIG. 2A shows the time-varying impulse response for an accelerating reflector in a channel represented by a one-dimensional channel model in a (r, t) coordinate system.

FIG. 2B shows the same channel represented using a time invariant impulse response in a delay-Doppler (r, v) coordinate system.

FIG. 3A is a block diagram of components of an exemplary OTFS communication system.

FIG. 3B provides a pictorial view of two transformations constituting an exemplary form of OTFS modulation.

FIG. 3C shows a block diagram of different processing stages at an OTFS transmitter and an OTFS receiver.

FIG. 4 represents a conceptual implementation of a Heisenberg transform in an OTFS transmitter and a Wigner transform in an OTFS receiver.

FIG. 5 illustratively represents an exemplary embodiment of OTFS modulation, including the transformation of the time-frequency plane to the Doppler-delay plane.

FIG. 6 shows a discrete impulse in the OTFS domain which is used for purposes of channel estimation.

FIG. 7 illustrates two different basis functions belonging to different users, each of which spans the entire time-frequency frame.

FIGS. 8 and 9 illustrate multiplexing multiple users in the time-frequency domain by allocating different resource blocks or subframes to different users in an interleaved manner.

FIG. 10 illustrates components of an exemplary OTFS transceiver.

FIG. 11 illustrates a comparison of bit error rates (BER) predicted by a simulation of a TDMA system and an OTFS system.

FIG. 12 is a flowchart representative of the operations performed by an exemplary OTFS transceiver.

FIG. 13 illustrates functioning of an OTFS modulator as an orthogonal map disposed to transform a two-dimensional time-frequency matrix into a transmitted waveform.

FIG. 14 illustrates operation of an OTFS demodulator in transforming a received waveform into a two-dimensional time-frequency matrix in accordance with an orthogonal map.

FIG. 15 illustratively represents a pulse train included within a pulse waveform produced by an OTFS modulator.

FIG. 16 depicts a two-dimensional decision feedback equalizer configured to perform a least means square (LMS) equalization procedure.

FIGS. 17A-17D depict an OTFS transmitter and receiver and the operation of each with respect to associated time-frequency grids.

FIG. 18 includes a set of bar diagrams representing a two-dimensional impulse response realizing a finite modulation equivalent channel, a transmitted information vector x and a received information vector y.

FIG. 19 illustrates transmission of a 2D Fourier transformed information manifold represented by an N×M structure over M frequency bands during N time periods of duration Tμ.

FIG. 20 shows an example of M filtered OTFS frequency bands being simultaneously transmitted according to various smaller time slices Tμ.

FIG. 21 provides an additional example of OTFS waveforms being transmitted according to various smaller time slices Tμ.

FIG. 22 provides a block diagrammatic representation of an exemplary process of OTFS transmission and reception.

FIG. 23 illustrates represents an exemplary structure of finite OTFS modulation map.

FIGS. 24A and 24B respectively illustrate a standard communication lattice and the reciprocal of the standard communication lattice.

FIG. 25 illustratively represents a standard communication torus.

FIG. 26 illustratively represents a standard communication finite torus.

FIG. 27 illustrates an exemplary structure of an OTFS modulation map.

FIG. 28 illustrates a frequency domain interpretation of an OTFS modulation block.

DETAILED DESCRIPTION

As is discussed below, embodiments of orthogonal time frequency space (OTFS) modulation involve transmitting each information symbol by modulating a two-dimensional (2D) basis function on the time-frequency plane. In exemplary embodiments the modulation basis function set is specifically derived to best represent the dynamics of the time varying multipath channel. In this way OTFS transforms the time-varying multipath channel into a time invariant delay-Doppler two dimensional convolution channel. This effectively eliminates the difficulties in tracking time-varying fading in, for example, communications involving high speed vehicles.

OTFS increases the coherence time of the channel by orders of magnitude. It simplifies signaling over the channel using well studied AWGN codes over the average channel SNR. More importantly, it enables linear scaling of throughput with the number of antennas in moving vehicle applications due to the inherently accurate and efficient estimation of channel state information (CSI). In addition, since the delay-Doppler channel representation is very compact, OTFS enables massive MIMO and beamforming with CSI at the transmitter for four, eight, and more antennas in moving vehicle applications. The CSI information needed in OTFS is a fraction of what is needed to track a time varying channel.

As will be appreciated from the discussion below, one characteristic of OTFS is that a single QAM symbol may be spread over multiple time and/or frequency points. This is a key technique to increase processing gain and in building penetration capabilities for IoT deployment and PSTN replacement applications. Spreading in the OTFS domain allows spreading over wider bandwidth and time durations while maintaining a stationary channel that does not need to be tracked over time.

These benefits of OTFS will become apparent once the basic concepts behind OTFS are understood. There is a rich mathematical foundation of OTFS that leads to several variations; for example it can be combined with OFDM or with multicarrier filter banks. Prior to proceeding to a detailed discussion of OTFS, various drawbacks of communication systems predicated on one-dimensional channel models are first described.

FIG. 1A illustrates an example of a wireless communication system 100 that may exhibit time/frequency selective fading. The system 100 includes a transmitter 110 (e.g., a cell phone tower) and a receiver 120 (e.g., a cell phone). The scenario illustrated in FIG. 1 includes multiple pathways (multi-path) that the signal transmitted from the transmitter 100 travels through before arriving at the receiver 100. A first pathway 130 reflects through a tree 132, second pathway 140 reflects off of a building 142 and a third pathway 150 reflects off of a second building 152. A fourth pathway 160 reflects off of a moving car 162. Because each of the pathways 130, 140, 150 and 160 travels a different distance, and is attenuated or faded at a different level and at a different frequency, when conventionally configured the receiver 120 may drop a call or at least suffer low throughput due to destructive interference of the multi-path signals.

Turning now to FIG. 1B, a high-level representation is provided of a conventional transceiver 200 which could be utilized in the wireless communication system 100 of FIG. 1A. The transceiver 200 could, for example, operate in accordance with established protocols for time-division multiple access (TDMA), code-division multiple access (CDMA) or orthogonal frequency-division multiple access (OFDM) systems. In conventional wireless communication systems such as TDMA, CDMA, and OFDM) systems, the multipath communication channel 210 between a transmitter 204 and a receiver 208 is represented by a one-dimensional model. In these systems channel distortion is characterized using a one-dimensional representation of the impulse response of the communication channel. The transceiver 200 may include a one-dimensional equalizer 220 configured to at least partially remove this estimated channel distortion from the one-dimensional output data stream 230 produced by the receiver 208.

Unfortunately, use of a one-dimensional channel model presents a number of fundamental problems. First, the one-dimensional channel models employed in existing communication systems are non-stationary; that is, the symbol-distorting influence of the communication channel changes from symbol to symbol. In addition, when a channel is modeled in only one dimension it is likely and possible that certain received symbols will be significantly lower in energy than others due to “channel fading”. Finally, one-dimensional channel state information (CSI) appears random and much of it is estimated by interpolating between channel measurements taken at specific points, thus rendering the information inherently inaccurate. These problems are only exacerbated in multi-antenna (MIMO) communication systems. As is discussed below, embodiments of the OTFS method described herein can be used to substantially overcome the fundamental problems arising from use of a one-dimensional channel model.

The multipath fading channel is commonly modeled one-dimensionally in the baseband as a convolution channel with a time varying impulse response

$\begin{matrix} {{r(t)} = {\int{\left( {\tau,t} \right){s\left( {t - \tau} \right)}{\tau}}}} & (1) \end{matrix}$

where s(t) and r(t) represent the complex baseband channel input and output respectively and where

is the complex baseband time varying channel response.

This representation, while general, does not give us insight into the behavior and variations of the time varying impulse response. A more useful and insightful model, which is also commonly used for Doppler multipath doubly fading channels is

$\begin{matrix} {{r(t)} = {\int{\int{{h\left( {\tau,\nu} \right)}^{{j2\pi\nu}{({t - \tau})}}{s\left( {t - \tau} \right)}{\nu}{\tau}}}}} & (2) \end{matrix}$

In this representation, the received signal is a superposition of reflected copies of the transmitted signal, where each copy is delayed by the path delay τ, frequency shifted by the Doppler shift v and weighted by the time-independent delay-Doppler impulse response h(τ, v) for that τ and v. In addition to the intuitive nature of this representation, Eq. (2) maintains the generality of Eq. (1). In other words it can represent complex Doppler trajectories, like accelerating vehicles, reflectors etc. This can be seen if we express the time varying impulse response as a Fourier expansion with respect to the time variable t

$\begin{matrix} {{\left( {\tau,t} \right)} = {\int{{h\left( {\tau,v} \right)}^{{j2\pi}\; {vt}}{t}}}} & (3) \end{matrix}$

Substituting (3) in (1) we obtain Eq. (2) after some manipulation. As an example, FIG. 2A shows the time-varying impulse response for an accelerating reflector in the (τ, t) coordinate system, while FIG. 2B shows the same channel represented as a time invariant impulse response in the (τ, v) coordinate system.

An important feature revealed by these two figures is how compact the (τ, v) representation is compared to the (τ, t) representation. This has important implications for channel estimation, equalization and tracking as will be discussed later.

Notice that while h(τ, v) is, in fact, time-independent, the operation on s(t) is still time varying, as can be seen by the effect of the explicit complex exponential function of time in Eq. (2). In implementation the disclosed modulation scheme contemplates an appropriate choice of orthogonal basis functions that render the effects of this channel to become truly time-independent in the domain defined by those basis functions. The proposed scheme has the following high level outline.

First, let us consider a set of orthonormal basis functions φ_(τ, v)(t) indexed by which are orthogonal to translation and modulation, i.e.,

$\begin{matrix} {\mspace{79mu} {{{\varphi_{\tau,v}\left( {t - \tau_{0}} \right)} = {\varphi_{{\tau + \tau_{0}},v}(t)}}\mspace{79mu} {{\text{?}{\varphi_{\tau,v}(t)}} = {\varphi_{\tau,{v - v_{0}}}(t)}}{\text{?}\text{indicates text missing or illegible when filed}}}} & (4) \end{matrix}$

and let us consider the transmitted signal as a superposition of these basis functions

$\begin{matrix} {{s(t)} = {\int{\int{{x\left( {\tau,v} \right)}{\varphi_{\tau,v}(t)}{\tau}{v}}}}} & (5) \end{matrix}$

where the weights x(τ,v) represent the information bearing signal to be transmitted. After the transmitted signal of (5) goes through the time varying channel of Eq. (2) we obtain a superposition of delayed and modulated versions of the basis functions, which due to (4) results in

$\begin{matrix} \begin{matrix} {{r(t)} = {\int{\int{{h\left( {\tau,v} \right)}^{{j2}\; \pi \; {v{({t - \tau})}}}{s\left( {t - \tau} \right)}{v}{\tau}}}}} \\ {= {\int{\int{{{\varphi_{\tau,v}(t)}\left\lbrack {{h\left( {\tau,v} \right)}*{x\left( {\tau,v} \right)}} \right\rbrack}{\tau}{v}}}}} \end{matrix} & (6) \end{matrix}$

where * denotes two dimensional convolution. Eq. (6) can be thought of as a generalization of the convolution relationship for linear time invariant systems, using one dimensional exponentials as basis functions. Notice that the term in brackets can be recovered at the receiver by matched filtering against each basis function φ_(τ,v)(t). In this way a two dimensional channel relationship is established in the (τ, v) domain

y(τ,v)=h(τ, v)*x(τ, v)   (7)

where y(τ, v) is the receiver two dimensional matched filter output. Notice also, that in this domain the channel is described by a time invariant two-dimensional convolution.

A final different interpretation of the wireless channel will also be useful in what follows. Let us consider s(t) and r(t) as elements of the Hilbert space of square integrable functions

. Then Eq. (2) can be interpreted as a linear operator on

acting on the input s(t), parametrized by the impulse response h(τ, v), and producing the output r(t):

$\begin{matrix} {r = {{{\Pi_{h}(s)}\text{:}\mspace{14mu} {s(t)}} \in {\overset{\Pi_{h} \odot}{\rightarrow}{r(t)}} \in .}} & (8) \end{matrix}$

Notice that although the operator is linear, it is not time-invariant. If there is no Doppler, i.e., if h(v, τ)=h(0τ)δ(v), then Eq. (2) reduces to a time invariant convolution. Also notice that while for time invariant systems the impulse response is parameterized by one dimension, in the time varying case we have a two dimensional impulse response. While in the time invariant case the convolution operator produces a superposition of delays of the input s(t), (hence the parameterization is along the one dimensional delay axis) in the time varying case we have a superposition of delay-and-modulate operations as seen in Eq. (2) (hence the parameterization is along the two dimensional delay and Doppler axes). This is a major difference which makes the time varying representation non-commutative (in contrast to the convolution operation which is commutative), and complicates the treatment of time varying systems.

One important point of Eq. (8) is that the operator Π_(h)(*) can be compactly parametrized by a two dimensional function h(r,v), providing an efficient, time-independent description of the channel. Typical channel delay spreads and Doppler spreads are a very small fraction of the symbol duration and subcarrier spacing of multicarrier systems.

The representation of time varying systems defined by equations (2) and (8) may be characterized as a Heisenberg representation. In this regard it may be shown that every linear operator (eq. (8)) can be parameterized by some impulse response as in equation (2).

OTFS Modulation Over the Doppler Multipath Channel

The time variation of the channel introduces significant difficulties in wireless communications related to channel acquisition, tracking, equalization and transmission of channel state information (CSI) to the transmit side for beamforming and MIMO processing. We herein develop a modulation domain based on a set of orthonormal basis functions over which we can transmit the information symbols, and over which the information symbols experience a static, time invariant, two dimensional channel for the duration of the packet or burst transmission. In that modulation domain, the channel coherence time is increased by orders of magnitude and the issues associated with channel fading in the time or frequency domain in SISO or MIMO systems are significantly reduced.

FIG. 3 is a block diagram of components of an exemplary OTFS communication system 300. As shown, the system 300 includes a transmitter 310 and a receiver 330. The transmitting device 310 and the receiving device 330 include first and second OTFS transceivers 315-1 and 315-2, respectively. The OTFS transceivers 315-1 and 315-2 communicate, either unidirectionally or bidirectionally, via communication channel 320 in the manner described herein. Although in the exemplary embodiments described herein the system 300 may comprise a wireless communication system, in other embodiments the communication channel may comprise a wired communication channel such as, for example, a communication channel within a fiber optic or coaxial cable. As was described above, the communication channel 320 may include multiple pathways and be characterized by time/frequency selective fading.

The components of the OTFS transceiver may be implemented in hardware, software, or a combination thereof. For a hardware implementation, the processing units may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, micro-controllers, microprocessors, other electronic units designed to perform the functions described above, and/or a combination thereof.

Referring now to FIG. 3B, there is provided a pictorial view of the two transformations that constitute an exemplary form of OTFS modulation. It shows at a high level the signal processing steps that are required at a transmitter, such as the transmitter 310, and a receiver, such as the receiver 330. It also includes the parameters that define each step, which will become apparent as we further expose each step. Further, FIG. 3C shows a block diagram of the different processing stages at the transmitter and receiver and establishes the notation that will be used for the various signals.

We initially describe the transform which relates the waveform domain to the time-frequency domain.

The Heisenberg Transform

Our purpose in this section is to construct an appropriate transmit waveform which carries information provided by symbols on a grid in the time-frequency plane. Our intent in developing this modulation scheme is to transform the channel operation to an equivalent operation on the time-frequency domain with two important properties: (i) the channel is orthogonalized on the time-frequency grid; and (ii) the channel time variation is simplified on the time-frequency grid and can be addressed with an additional transform. Fortunately, these goals can be accomplished with a scheme that is very close to well-known multicarrier modulation techniques, as explained next. We will start with a general framework for multicarrier modulation and then give examples of OFDM and multicarrier filter bank implementations.

Let us consider the following components of a time frequency modulation:

-   -   A lattice or grid on the time frequency plane, that is a         sampling of the time axis with sampling period T and the         frequency axis with sampling period Δf.

Λ={(nT, mΔf), n, m, ∈

  (9)

-   -   A packet burst with total duration NT secs and total bandwidth         MΔf Hz     -   A set of modulation symbols X[n,m], n=0, . . . , N−1, m=0, . . .         , M−1 we wish to transmit over this burst     -   A transmit pulse g_(tr)(t) with the property of being orthogonal         to translations by T and modulations by Δf (generally required         if the receiver uses the same pulse as the transmitter)

$\begin{matrix} \begin{matrix} {{< {g_{tr}(t)}},{{{g_{tr}\left( {t - {nT}} \right)}^{{j2\pi}\; m\; \Delta \; {f{({t - {nT}})}}}}>={\int{{g_{tr}^{*}(t)}{g_{r}\left( {t - {nT}} \right)}^{j\; 2\pi \; m\; \Delta \; {f{({t - {nT}})}}}{t}}}}} \\ {= {{\delta (m)}{\delta (n)}}} \end{matrix} & (10) \end{matrix}$

Given the above components, the time-frequency modulator is a Heisenberg operator on the lattice A, that is, it maps the two dimensional symbols X[n, m] to a transmitted waveform, via a superposition of delay-and-modulate operations on the pulse waveform g_(tr)(t)

$\begin{matrix} {{s(t)} = {\sum\limits_{m = {{- M}/2}}^{{M/2} - 1}{\sum\limits_{n = 0}^{N - 1}{{X\left\lbrack {n,m} \right\rbrack}{g_{tr}\left( {t - {nT}} \right)}^{j\; 2\; \pi \; m\; \Delta \; {f{({t - {nT}})}}}}}}} & (11) \end{matrix}$

More formally

$\begin{matrix} {x = {{\Pi_{X}\left( g_{tr} \right)}{{g_{tr}(t)} \in {\mathcal{H}\overset{n_{X} \odot}{\rightarrow}{y(t)}} \in \mathcal{H}}}} & (12) \end{matrix}$

where we denote by Λ_(X)(*) the “discrete” Heisenberg operator, parameterized by discrete values X[n,m].

Notice the similarity of (12) with the channel equation (8). This is not by coincidence, but rather because we apply a modulation effect that mimics the channel effect, so that the end effect of the cascade of modulation and channel is more tractable at the receiver. It is not uncommon practice; for example, linear modulation (aimed at time invariant channels) is in its simplest form a convolution of the transmit pulse g(t) with a delta train of QAM information symbols sampled at the Baud rate T.

$\begin{matrix} {{s(t)} = {\sum\limits_{n = 0}^{N - 1}{{X\lbrack n\rbrack}{g\left( {t - {nT}} \right)}}}} & (13) \end{matrix}$

In the present case, aimed at the time varying channel, we convolve-and-modulate the transmit pulse (c.f. the channel Eq. (2)) with a two dimensional delta train which samples the time frequency domain at a certain Baud rate and subcarrier spacing.

The sampling rate in the time-frequency domain is related to the bandwidth and time duration of the pulse g_(tr)(t); namely, its time-frequency localization. In order for the orthogonality condition of (10) to hold for a frequency spacing Δf, the time spacing must be T≧1/Δf. The critical sampling case of T=1/Δf is generally not practical and refers to limiting cases, for example to OFDM systems with cyclic prefix length equal to zero or to filter banks with g_(tr)(t) equal to the ideal Nyquist pulse.

Some examples illustrate these principles:

EXAMPLE 1 OFDM Modulation

Let us consider an OFDM system with M subcarriers, symbol length T_(OFDM), cyclic prefix length T_(CF) and subcarrier spacing 1/T_(OFDM). If we substitute in Equation (11) symbol duration T=T_(OFDM)+T_(CF), number of symbols N=1, subcarrier spacing Δf=1/T_(OFDM) and g_(tr)(t) a square window that limits the duration of the subcarriers to the symbol length T

$\begin{matrix} {{g_{tr}(t)} = \left\{ \begin{matrix} {1/\sqrt{{T - T_{CP}},}} & {{- T_{CP}} < t < {T - T_{CP}}} \\ {0,} & {else} \end{matrix} \right.} & (14) \end{matrix}$

then we obtain the OFDM formula

$\begin{matrix} {{x(t)} = {\sum\limits_{m = {{- M}/2}}^{{M/2} - 1}{{X\left\lbrack {n,m} \right\rbrack}{g_{tr}(t)}^{j\; 2\; \pi \; m\; \Delta \; f\; t}}}} & (15) \end{matrix}$

Technically, the pulse of Eq. (14) is not orthonormal but is orthogonal to the receive filter (where the CP samples are discarded).

EXAMPLE 2 Single Carrier Modulation

Equation (11) reduces to single carrier modulation if we substitute M=1 subcarrier, T equal to the Baud period and g_(tr)(t) equal to a square root raised cosine Nyquist pulse.

EXAMPLE 3 Multicarrier Filter Banks (MCFB)

Equation (11) describes a MCFB if g_(tr)(τ) is a square root raised cosine Nyquist pulse with excess bandwidth α, T is equal to the Baud period and Δf=(1+α)/T.

Expressing the modulation operation as a Heisenberg transform as in Eq. (12) may be counterintuitive. That is, modulation is usually perceived as a transformation of the modulation symbols X[m, n] to a transmit waveform s(t). The Heisenberg transform instead, uses X[m, n] as weights/parameters of an operator that produces s(t) when applied to the prototype transmit filter response g_(tr)(t)—c.f. Eq. (12). While counterintuitive, this formulation is useful in pursuing an abstraction of the modulation-channel-demodulation cascade effects in a two dimensional domain where the channel can be described as time invariant.

Attention is turned next to the processing on the receiver side needed to go back from the waveform domain to the time-frequency domain. Since the received signal has undergone the cascade of two Heisenberg transforms (one by the modulation effect and one by the channel effect), it is natural to inquire what the end-to-end effect of this cascade is. The answer to this question is given by the following result:

Proposition 1: Let two Heisenberg transforms as defined by Eqs. (8), (2) be parametrized by impulse responses h₁(τ, v), h₂(τ, v) and be applied in cascade to a waveform g(τ) ∈K. Then

$\begin{matrix} {{\Pi_{h_{2}}\left( {\Pi_{h_{2}}\left( {g(t)} \right)} \right)} = {\Pi_{h}\left( {g(t)} \right)}} & (16) \end{matrix}$

where h(τ, v)=h₂(τ, v)⊙h₁(τ, v) is the “twisted” convolution of h₁(τ, v), h₂(τ, v) defined by the following convolve-and-modulate operation

$\begin{matrix} {{h\left( {\tau,v} \right)} = {\int{\int{{h_{2}\left( {\tau^{\prime},v^{\prime}} \right)}{h_{1}\left( {{\tau - \tau^{\prime}},{v - v^{\prime}}} \right)}^{{j2\pi}\; {v^{\prime}{({\tau - \tau^{\prime}})}}t}{\tau^{\prime}}{v^{\prime}}}}}} & (17) \end{matrix}$

Applying the above result to the cascade of the modulation and channel Heisenberg transforms of (12) and (8), one can show that the received signal is given by the Heisenberg transform

$\begin{matrix} {{r(t)} = {{{\Pi_{f}\left( {g_{tr}(t)} \right)} + {v(t)}} = {{\int{\int{{f\left( {\tau,v} \right)}^{{j2\pi}\; {v{({t - \tau})}}}{g_{tr}\left( {t - \tau} \right)}{v}{\tau}}}} + {v(t)}}}} & (18) \end{matrix}$

where v(t) is additive noise and f(r,v), the impulse response of the combined transform, is given by the twisted convolution of X[n, m] and h(r, v)

$\begin{matrix} {{f\left( {\tau,v} \right)} = {{{h\left( {\tau,v} \right)} \odot {X\left\lbrack {n,m} \right\rbrack}} = {\sum\limits_{m = {{- M}/2}}^{{M/2} - 1}{\sum\limits_{n = 0}^{N - 1}{{X\left\lbrack {n,m} \right\rbrack}{h\left( {{\tau - {nT}},{v - {m\; \Delta \; f}}} \right)}^{j\; 2\; {\pi {({v - {m\; \Delta \; f}})}}{nT}}}}}}} & (19) \end{matrix}$

This result can be considered an extension of the single carrier modulation case, where the received signal through a time invariant channel is given by the convolution of the QAM symbols with a composite pulse, that pulse being the convolution of the transmitter pulse and the channel impulse response.

With this result established we are ready to examine exemplary receiver processing steps.

Receiver Processing and the Wigner Transform

Typical communication system design generally requires that the receiver perform a matched filtering operation, taking the inner product of the received waveform with the transmitter pulse, appropriately delayed or otherwise distorted by the channel. In the present case, we have used a collection of delayed and modulated transmit pulses, and a matched filtering operation is typically performed with respect to each one of them.

FIG. 4 provides a conceptual view of this processing. On the transmitter, we modulate a set of M subcarriers for each symbol we transmit, while on the receiver we perform matched filtering on each of those subcarrier pulses. We define a receiver pulse g_(r)(t) and take the inner product with a collection of delayed and modulated versions of it. The receiver pulse g_(r)(t) is in many cases identical to the transmitter pulse, but we keep the separate notation to cover some cases where it is not (most notably in OFDM where the CP samples have to be discarded).

While this approach will yield the sufficient statistics for data detection in the case of an ideal channel, a concern can be raised here for the case of non-ideal channel effects. In this case, the sufficient statistics for symbol detection are obtained by matched filtering with the channel-distorted, information-carrying pulses (assuming that the additive noise is white and Gaussian). In many well designed multicarrier systems however (e.g., OFDM and MCFB), the channel distorted version of each subcarrier signal is only a scalar version of the transmitted signal, allowing for a matched filter design that is independent of the channel and uses the original transmitted subcarrier pulse. We will make these statements more precise shortly and examine the required conditions for this to be true.

In actual embodiments of an OTFS receiver, this matched filtering may be implemented in the digital domain using an FFT or a polyphase transform for OFDM and MCFB respectively. However, for purposes of the present discussion, we will consider a generalization of this matched filtering by taking the inner product <g_(r)(t−τ)∈¹²

^((t−r)), r(t)>of the received waveform with the delayed and modulated versions of the receiver pulse for arbitrary time and frequency offset (τ, v). While likely not necessarily a practical implementation, it allows us to view the operations of FIG. 4 as a two dimensional sampling of this more general inner product.

Let us define the inner product

$\begin{matrix} {{{A_{g_{r},r}\left( {\tau,v} \right)} = {< {{g_{r}\left( {t - \tau} \right)}^{{j2\pi}\; {v{({t - \tau})}}}}}},{{r(t)}>={\int{{g_{r}^{*}\left( {t - \tau} \right)}^{{- {j2\pi}}\; {v{({t - \tau})}}}{r(t)}{t}}}}} & (20) \end{matrix}$

The function A

(τ, v) is known as the cross-ambiguity function and yields the matched filter output if sampled at τ=nT, v=mΔf (on the lattice A), i.e.,

$\begin{matrix} {{Y\left\lbrack {n,m} \right\rbrack} = {{A_{g_{r},r}\left( {\tau,v} \right)}_{{\tau = {nT}},{v = {m\; \Delta \; f}}}}} & (21) \end{matrix}$

The ambiguity function is related to the inverse of the Heisenberg transform, namely the Wigner transform. FIG. 4 provides an intuitive feel for that, as the receiver appears to invert the operations of the transmitter. More formally, if we take the cross-ambiguity or the transmit and receive pulses A

_(tr) (τ,v), and use it as the impulse response of the Heisenberg operator, then we obtain the orthogonal cross-projection operator

Π_(A_(g_(r), g_(tr)))(y(t)) = g_(tr)(t) < g_(r)(t), y(t)>

In words, the coefficients that come out of the matched filter, if used in a Heisenberg representation, will provide the best approximation to the original y(t) in the sense of minimum square error.

One key question to be addressed is the relationship is between the matched filter output Y[n, m] (or more generally Y(τ, v)) and the transmitter input X[n, m]. We have already established in (18) that the input to the matched filter r(t) can be expressed as a Heisenberg representation with impulse response f(τ, v) (plus noise). The output of the matched filter then has two contributions

$\begin{matrix} {{Y\left( {\tau,v} \right)} = {{A_{g_{r},r}\left( {\tau,v} \right)} = {{A_{g_{r},{\lbrack{{\Pi_{f}{(g_{tr})}} + v}\rbrack}}\left( {\tau,v} \right)} = {{A_{g_{r},{\Pi_{f}{(g_{tr})}}}\left( {\tau,v} \right)} + {A_{g_{r},v}\left( {\tau,v} \right)}}}}} & (22) \end{matrix}$

The last term is the contribution of noise, which we will denote V(τ, v)=A

(τ, v). The first term on the right hand side is the matched filter output to the (noiseless) input comprising of a superposition of delayed and modulated versions of the transmit pulse. We next establish that this term can be expressed as the twisted convolution of the two dimensional impulse response f(τ,v) with the cross-ambiguity function (or two dimensional cross correlation) of the transmit and receive pulses.

The following theorem summarizes the key result.

Theorem 1: (Fundamental time-frequency domain channel equation). If the received signal can be expressed as

$\begin{matrix} {{\Pi_{f}\left( {g_{tr}(t)} \right)} = {\int{\int{{f\left( {\tau,v} \right)}^{{j2\pi}\; {v{({t - \tau})}}}{g_{tr}\left( {t - \tau} \right)}{v}{\tau}}}}} & (23) \end{matrix}$

Then the cross-ambiguity of that signal with the receive pulse g_(tr)(t) can be expressed as

$\begin{matrix} {{A_{g_{r},{\Pi_{f}{(g_{tr})}}}\left( {\tau,v} \right)} = {{f\left( {\tau,v} \right)} \odot {A_{g_{r},g_{tr}}\left( {\tau,v} \right)}}} & (24) \end{matrix}$

Recall from (19) that f(τ, v)=h(τ, v)∈X[n,m], that is, the composite impulse response is itself a twisted convolution of the channel response and the modulation symbols.

Substituting f(τ, v) from (19) into (22) we obtain the end-to-end channel description in the time frequency domain

$\begin{matrix} \begin{matrix} {{Y\left( {\tau,v} \right)} = {{A_{g_{r},{\Pi_{r}{(g_{tr})}}}\left( {\tau,v} \right)} + {V\left( {\tau,v} \right)}}} \\ {= {{{h\left( {\tau,v} \right)} \odot {X\left\lbrack {n,m} \right\rbrack} \odot {A_{g_{r},g_{tr}}\left( {\tau,v} \right)}} + {V\left( {\tau,v} \right)}}} \end{matrix} & (25) \end{matrix}$

where V(τ, v) is the additive noise term. Eq. (25) provides an abstraction of the time varying channel on the time-frequency plane. It states that the matched filter output at any time and frequency point (τ, v) is given by the delay-Doppler impulse response of the channel twist-convolved with the impulse response of the modulation operator twist-convolved with the cross-ambiguity (or two dimensional cross correlation) function of the transmit and receive pulses.

Evaluating Eq. (25) on the lattice A we obtain the matched filter output modulation symbol estimates

$\begin{matrix} {{\hat{X}\left\lbrack {m,n} \right\rbrack} = {{Y\left\lbrack {n,m} \right\rbrack} = {{Y\left( {\tau,v} \right)}_{{\tau = {nT}},{v = {m\; \Delta \; f}}}}}} & (26) \end{matrix}$

In order to get more intuition on Equations (25), (26) let us first consider the case of an ideal channel, i.e., h(τ,v)=δ(τ)δ(v). In this case by direct substitution we get the convolution relationship

$\begin{matrix} {{Y\left\lbrack {n,m} \right\rbrack} = {{\sum\limits_{m^{\prime} = {{- M}/2}}^{{M/2} - 1}{\sum\limits_{n^{\prime} = 0}^{N - 1}{{X\left\lbrack {n^{\prime},m^{\prime}} \right\rbrack}{A_{g_{r},g_{tr}}\left( {{\left( {n - n^{\prime}} \right)T},{\left( {m - m^{\prime}} \right)\Delta \; f}} \right)}}}} + {V\left\lbrack {m,n} \right\rbrack}}} & (27) \end{matrix}$

In order to simplify Eq. (27) we will use the orthogonality properties of the ambiguity function. Since we use a different transmit and receive pulses we will modify the orthogonality condition on the design of the transmit pulse we stated in (10) to a bi-orthogonality condition

$\begin{matrix} {{\langle{{g_{tr}(t)},{{g_{r}\left( {t - {nT}} \right)}^{j\; 2\; \pi \; m\; \Delta \; {f{({t - {nT}})}}}}}\rangle} = {{\int{{g_{tr}^{*}(t)}{g_{r}\left( {t - {nT}} \right)}^{j\; 2\; \pi \; m\; \Delta \; {f{({t - {nT}})}}}{t}}} = {{\delta (m)}{\delta (n)}}}} & (28) \end{matrix}$

Under this condition, only one term survives in (27) and we obtain

$\begin{matrix} {{Y\left\lbrack {n,m} \right\rbrack} = {{X\left\lbrack {n,m} \right\rbrack} + {V\left\lbrack {n,m} \right\rbrack}}} & (29) \end{matrix}$

where V[n,m] is the additive white noise. Eq. (29) shows that the matched filter output does recover the transmitted symbols (plus noise) under ideal channel conditions. Of more interest of course is the case of non-ideal time varying channel effects. We next show that even in this case, the channel orthogonalization is maintained (no intersymbol or intercarrier interference), while the channel complex gain distortion has a closed form expression.

The following theorem summarizes the result as a generalization of (29).

Theorem 2: (End-to-end time-frequency domain channel equation):

If h(τ, v) has finite support bounded by (τ_(max), v_(max)) and if A

(τ,v)=0 for τ∈(nT−τ_(max), nT+τ_(max)), v∈(mΔf−v_(max),mΔf+v_(max)), that is, the ambiguity function bi-orthogonality property of (28) is true in a neighborhood of each grid point (mΔf, nT) of the lattice A at least as large as the support of the channel response h(τ, v), then the following equation holds

$\begin{matrix} {{{Y\left\lbrack {n,m} \right\rbrack} = {{H\left\lbrack {n,m} \right\rbrack}{X\left\lbrack {n,m} \right\rbrack}}}{{H\left\lbrack {n,m} \right\rbrack} = {\int{\int{{h\left( {\tau,v} \right)}^{{j2\pi}\; {vnT}}^{{- {{j2\pi}{({v + {m\; \Delta \; f}})}}}\tau}{v}{\tau}}}}}} & (30) \end{matrix}$

If the ambiguity function is only approximately bi-orthogonal in the neighborhood of A (by continuity), then (30) is only approximately true. Eq. (30) is a fundamental equation that describes the channel behavior the time-frequency domain. It is the basis for understanding the nature of the channel and its variations along the time and frequency dimensions.

Some observations are now in order on Eq. (30). As mentioned before, there is no interference across X[n,m] in either time n or frequency m.

-   -   The end-to-end channel distortion in the modulation domain is a         (complex) scalar that needs to be equalized.     -   If there is no Doppler, i.e. h(τ, v)=h(τ, 0)δ(v), then Eq. (30)         becomes

$\begin{matrix} \begin{matrix} {{Y\left\lbrack {n,m} \right\rbrack} = {{X\left\lbrack {n,m} \right\rbrack}{\int{{h\left( {\tau,0} \right)}^{{- j}\; 2\; \pi \; m\; \Delta \; f\; \tau}{\tau}}}}} \\ {= {{X\left\lbrack {n,m} \right\rbrack}{H\left( {0,{m\; \Delta \; f}} \right)}}} \end{matrix} & (31) \end{matrix}$

which is the well-known multicarrier result, that each subcarrier symbol is multiplied by the frequency response of the time invariant channel evaluated at the frequency of that subcarrier.

-   -   If there is no multipath, i.e. h(τ,v)=h(0, v)δ(τ), then Eq. (30)         becomes

$\begin{matrix} {{Y\left\lbrack {n,m} \right\rbrack} = {{X\left\lbrack {n,m} \right\rbrack}{\int{{h\left( {v,0} \right)}^{{j2\pi}\; {rnT}}{\tau}}}}} & (32) \end{matrix}$

Notice that the fading each subcarrier experiences as a function of time nT has a complicated expression as a weighted superposition of exponentials. This is a major complication in the design of wireless systems with mobility like LTE; it necessitates the transmission of pilots and the continuous tracking of the channel, which becomes more difficult the higher the vehicle speed or Doppler bandwidth is.

Some examples of this general framework are provided below.

EXAMPLE 3 OFDM Modulation

In this case the fundamental transmit pulse is given by (14) and the fundamental receive pulse is

$\begin{matrix} {{g_{r}(t)} = \left\{ \begin{matrix} 0 & {{- T_{CP}} < t < 0} \\ \frac{1}{\sqrt{T - T_{CP}}} & {0 < t < {T - T_{CP}}} \\ 0 & {else} \end{matrix} \right.} & (33) \end{matrix}$

i.e., the receiver zeroes out the CP samples and applies a square window to the symbols comprising the OFDM symbol. It is worth noting that in this case, the bi-orthogonality property holds exactly along the time dimension.

EXAMPLE 4 MCFB Modulation

In the case of multicarrier filter banks g_(tr)(t)=g_(r)(t)=g(t). There are several designs for the fundamental pulse g(t). A square root raised cosine pulse provides good localization along the frequency dimension at the expense of less localization along the time dimension. If T is much larger than the support of the channel in the time dimension, then each subchannel sees a flat channel and the bi-orthogonality property holds approximately.

In summary, one of the two transforms defining OTFS has now been described. Specifically, an explanation has been provided of how the transmitter and receiver apply appropriate operators on the fundamental transmit and receive pulses and orthogonalize the channel according to Eq. (30). Examples have also been provided to illustrate how the choice of the fundamental pulse affects the time and frequency localization of the transmitted modulation symbols and the quality of the channel orthogonalization that is achieved. However, Eq. (30) shows that the channel in this domain, while free of intersymbol interference, suffers from fading across both the time and the frequency dimensions via a complicated superposition of linear phase factors.

In what follows we start from Eq. (30) and describe the second transform that defines OTFS; we will show how that transform defines an information domain where the channel does not fade in either dimension.

The 2D OTFS Transform

Notice that the time-frequency response H[n,m] in (30) is related to the channel delay-Doppler response h(τ, v) by an expression that resembles a Fourier transform. However, there are two important differences: (i) the transform is two dimensional (along delay and Doppler) and (ii) the exponentials defining the transforms for the two dimensions have opposing signs. Despite these difficulties, Eq. (30) points in the direction of using complex exponentials as basis functions on which to modulate the information symbols; and only transmit on the time-frequency domain the superposition of those modulated complex exponential bases. As is discussed below, this approach exploits Fourier transform properties and effectively translates a multiplicative channel in one Fourier domain to a convolution channel in the other Fourier domain.

Given the difficulties of Eq. (30) mentioned above, we need to develop a suitable version of Fourier transform and associated sampling theory results. Let us start with the following definitions:

Definition 1: Symplectic Discrete Fourier Transform: Given a square summable two dimensional sequence X[m,n]∈C(A) we define

$\begin{matrix} \begin{matrix} {{x\left( {\tau,v} \right)} = {\sum\limits_{m,n}{{X\left\lbrack {n,m} \right\rbrack}^{{- j}\; 2\; {\pi {({{v\; {nT}} - {\tau \; m\; \Delta \; f}})}}}}}} \\ {\overset{\Delta}{=}{S\; D\; F\; {T\left( {X\left\lbrack {n,m} \right\rbrack} \right)}}} \end{matrix} & (34) \end{matrix}$

Notice that the above 2D Fourier transform (known as the Symplectic Discrete Fourier Transform) differs from the more well known Cartesian Fourier transform in that the exponential functions across each of the two dimensions have opposing signs. This is necessary in this case, as it matches the behavior of the channel equation.

Further notice that the resulting x(τ, v) is periodic with periods (1/f, 1/T). This transform defines a new two dimensional plane, which we will call the delay-Doppler plane, and which can represent a max delay of 1/Δf and a max Doppler of 1/T A one dimensional periodic function is also called a function on a circle, while a 2D periodic function is called a function on a torus (or donut). In this case x(τ,v) is defined on a torus Z with circumferences (dimensions) (1/Δf,1/T).

The periodicity of x(τ,v) (or sampling rate of the time-frequency plane) also defines a lattice on the delay-Doppler plane, which we will call the reciprocal lattice

$\begin{matrix} {\Lambda^{\bot} = \left\{ {\left( {{m\frac{1}{\Delta \; f}},{n\frac{1}{T}}} \right),n,{m \in Z}} \right\}} & (35) \end{matrix}$

The points on the reciprocal lattice have the property of making the exponent in (34), an integer multiple of 2π.

The inverse transform is given by:

$\begin{matrix} \begin{matrix} {{X\left\lbrack {n,m} \right\rbrack} = {\frac{1}{c}{\int_{0}^{\frac{1}{\Delta \; f}}{\int_{0}^{\frac{1}{T}}{{x\left( {\tau,v} \right)}^{j\; 2\; {\pi {({{v\; {nT}} - {\tau \; m\; \Delta \; f}})}}}{v}{\tau}}}}}} \\ {\overset{\Delta}{=}{S\; D\; F\; {T^{- 1}\left( {x\left( {\tau,v} \right)} \right)}}} \end{matrix} & (36) \end{matrix}$

where c=TΔf.

We next define a sampled version of x(τ, v). In particular, we wish to take M samples on the delay dimension (spaced at 1/MΔf) and N samples on the Doppler dimension (spaced at 1/NT). More formally, a denser version of the reciprocal lattice is defined so that Λ⊂Λ1/0.

$\begin{matrix} {\Lambda_{0}^{\bot} = \left\{ {\left( {{m\frac{1}{M\; \Delta \; f}},{n\frac{1}{NT}}} \right),n,{m \in Z}} \right\}} & (37) \end{matrix}$

We define discrete periodic functions on this dense lattice with period (1/Δf,1/T), or equivalently we define functions on a discrete torus with these dimensions

$\begin{matrix} {Z_{0}^{\bot} = \left\{ {\left( {{m\frac{1}{M\; \Delta \; f}},{n\frac{1}{NT}}} \right),{m = 0},\ldots \mspace{11mu},{M - 1},{n = 0},{{\ldots \mspace{14mu} N} - 1},} \right\}} & (38) \end{matrix}$

These functions are related via Fourier transform relationships to discrete periodic functions on the lattice A, or equivalently, functions on the discrete torus

$\begin{matrix} {Z_{0} = \left\{ {\left( {{nT},{m\; \Delta \; f}} \right),\mspace{14mu} {m = 0},\ldots \mspace{14mu},{M - 1},\mspace{14mu} {n = 0},{{\ldots \mspace{14mu} N} - 1},} \right\}} & (39) \end{matrix}$

We wish to develop an expression for sampling Eq. (34) on the lattice of (38). First, we start with the following definition.

Definition 2: Symplectic Finite Fourier Transform: If X_(p)[k,l] is periodic with period (N, M), then we define

$\begin{matrix} \begin{matrix} {{x_{p}\left\lbrack {m,n} \right\rbrack} = {\sum\limits_{k = 0}^{N - 1}{\sum\limits_{l = {- \frac{M}{3}}}^{\frac{M}{2} - 1}{{X_{p}\left\lbrack {k,l} \right\rbrack}^{- {{j2\pi}{({\frac{nk}{N} - \frac{mt}{M}})}}}}}}} \\ {\overset{\Delta}{=}{{SFFT}\left( {X\left\lbrack {k,l} \right\rbrack} \right)}} \end{matrix} & (40) \end{matrix}$

Notice that x_(p)[m,n] is also periodic with period [M,N] or, equivalently, it is defined on the discrete torus Z_(b 1/0.) Formally, the SEFT[n,m] is a linear transformation from C(Z_(o))→C(Z1/0).

Let us now consider generating x_(p)[m,n] as a sampled version of (34), i.e.,

${x_{p}\left\lbrack {m,n} \right\rbrack} = {{x\left\lbrack {m,n} \right\rbrack} = {{x\left( {\tau,v} \right)}_{{\tau = \frac{m}{M\; \Delta \; f}},{v = \frac{n}{NT}}}.}}$

Then we can show that (40) still holds where X_(p)[m,n] is a periodization of X[n,m] with period (N, M)

$\begin{matrix} {{X_{p}\left\lbrack {n,m} \right\rbrack} = {\sum\limits_{l,{k = {- \infty}}}^{\infty}{X\left\lbrack {{n - {kN}},{m - {lM}}} \right\rbrack}}} & (41) \end{matrix}$

This is similar to the result that sampling in one Fourier domain creates aliasing in the other domain.

The inverse discrete (symplectic) Fourier transform is given by

$\begin{matrix} \begin{matrix} {{X_{p}\left\lbrack {n,m} \right\rbrack} = {\frac{1}{MN}{\sum\limits_{l,k}{{x\left\lbrack {l,k} \right\rbrack}^{{j2\pi}{({\frac{nk}{N} - \frac{ml}{M}})}}}}}} \\ {\overset{\Delta}{=}{{SFFT}^{- 1}\left( {x\left\lbrack {l,k} \right\rbrack} \right)}} \end{matrix} & (42) \end{matrix}$

where l=0, . . . , M−1, k=0, . . . , m N−1. If the support of X[n,m] is time-frequency limited to Z₀ (no aliasing in (41)), then X_(p)[n,m]=X[n,m] for n, m, ∈ Z₀, and the inverse transform (42) recovers the original signal.

The SDFT is termed “discrete” because it represents a signal using a discrete set of exponentials, while the SFFT is called “finite” because it represents a signal using a finite set of exponentials.

In the present context, an important property of the symplectic Fourier transform is that it transforms a multiplicative channel effect in one domain to a circular convolution effect in the transformed domain. This is summarized in the following proposition:

Proposition 2: Let X₁[n,m]∈C(Z₀), X₂[n,m]∈C(Z₀) be periodic 2D sequences. Then

$\begin{matrix} {{{SFFT}\left( {{X_{1}\left\lbrack {n,m} \right\rbrack}*{X_{2}\left\lbrack {n,m} \right\rbrack}} \right)} = {{{SFFT}\left( {X_{1}\left\lbrack {n,m} \right\rbrack} \right)} \cdot {{SFFT}\left( {X_{2}\left\lbrack {n,m} \right\rbrack} \right)}}} & (43) \end{matrix}$

where * denotes two dimensional circular convolution. With this framework established we are ready to define the OTFS modulation.

Discrete OTFS modulation: Consider a set of NM QAM information symbols arranged on a 2D grid x[l,k], k=0, . . . , N−1, l=0, . . . , M−1 we wish to transmit. We will consider x[l,k] to be two dimensional periodic with period [N,M]. Further, assume a multicarrier modulation system defined by

-   -   A lattice on the time frequency plane, that is a sampling of the         time axis with sampling period T and the frequency axis with         sampling period Δf (c.f. Eq. (9)).     -   A packet burst with total duration NT secs and total bandwidth         MΔf Hz.     -   Transmit and receive pulses g_(tr)(c), g_(tr)(t)∈L₂(R)         satisfying the bi-orthogonality property of (28)     -   A transmit windowing square summable function W         [n,m]∈C(Λ) multiplying the modulation symbols in the         time-frequency domain     -   A set of modulation symbols X[n,m], n=0, . . . , N−1, m=0, . . .         , M−11 related to the information symbols x[k,l] by a set of         basis functions b_(k,l)[n,m]

$\begin{matrix} {{{X\left\lbrack {n,m} \right\rbrack} = {\frac{1}{MN}{W_{tr}\left\lbrack {n,m} \right\rbrack}{\sum\limits_{k = 0}^{N - 1}{\sum\limits_{l = 0}^{M - 1}{{x\left\lbrack {l,k} \right\rbrack}{b_{k,l}\left\lbrack {n,m} \right\rbrack}}}}}}{{b_{k,l}\left\lbrack {n,m} \right\rbrack} = ^{{j2\pi}{({\frac{ml}{M} - \frac{nk}{N}})}}}} & (44) \end{matrix}$

where the basis functions b_(k,l)[n,m] are related to the inverse symplectic Fourier transform (c.f., Eq. (42))

Given the above components, we define the discrete OTFS modulation via the following two steps

$\begin{matrix} {{{X\left\lbrack {n,m} \right\rbrack} = {{W_{r}\left\lbrack {n,m} \right\rbrack}{{SFFT}^{- 1}\left( {x\left\lbrack {k,l} \right\rbrack} \right)}}}{{s(t)} = {\Pi_{X}\left( {g_{tr}(t)} \right)}}} & (45) \end{matrix}$

The first equation in (45) describes the OTFS transform, which combines an inverse symplectic transform with a widowing operation. The second equation describes the transmission of the modulation symbols X[n,m] via a Heisenberg transform of g_(tr)(t) parameterized by X[n,m]. More explicit formulas for the modulation steps are given by Equations (42) and (11).

While the expression of the OTFS modulation via the symplectic Fourier transform reveals important properties, it is easier to understand the modulation via Eq. (44), that is, transmitting each information symbol x,[k,l] by modulating a 2D basis function b

[n,m] on the time-frequency plane.

Discrete OTFS demodulation: Let us assume that the transmitted signal s(t) undergoes channel distortion according to (8), (2) yielding r(t) at the receiver. Further, let the receiver employ a receive windowing square summable function W_(r)[n,m]. Then, the demodulation operation consists of the following steps:

-   -   (i) Matched filtering with the receive pulse, or more formally,         evaluating the ambiguity function on Λ (Wigner transform) to         obtain estimates of the time-frequency modulation symbols

$\begin{matrix} {{Y\left\lbrack {n,m} \right\rbrack} = \left. {A_{{gr},y}\left( {\tau,\gamma} \right)} \right|_{{\tau = {nT}},{\gamma = {m\; \Delta \; f}}}} & (46) \end{matrix}$

-   -   (ii) windowing and periodization of Y[n,m]

$\begin{matrix} {{{Y_{W}\left\lbrack {n,m} \right\rbrack} = {{W_{r}\left\lbrack {n,m} \right\rbrack}{Y\left\lbrack {n,m} \right\rbrack}}}{{Y_{p}\left\lbrack {n,m} \right\rbrack} = {\sum\limits_{k,{l = {- \infty}}}^{\infty}{Y_{W}\left\lbrack {{n - {kN}},{m - {lM}}} \right\rbrack}}}} & (47) \end{matrix}$

-   -   (iii) and applying the symplectic Fourier transform on the         periodic sequence Y_(p)[n,m]

$\begin{matrix} {{\hat{x}\left\lbrack {l,k} \right\rbrack} = {{y\left\lbrack {l,k} \right\rbrack} = {{SFFT}\left( {Y_{p}\left\lbrack {n,m} \right\rbrack} \right)}}} & (48) \end{matrix}$

The first step of the demodulation operation can be interpreted as a matched filtering operation on the time-frequency domain as we discussed earlier. The second step is there to ensure that the input to the SFFT is a periodic sequence. If the trivial window is used, this step can be skipped. The third step can also be interpreted as a projection of the time-frequency modulation symbols on the orthogonal basis functions

$\begin{matrix} {{{\hat{x}\left\lbrack {l,k} \right\rbrack} = {\sum\limits_{m = 0}^{M - 1}{\sum\limits_{n = 0}^{N - 1}{{\hat{X}\left( {n,m} \right)}{b_{k,l}^{*}\left( {n,m} \right)}}}}}{{b_{k,l}^{*}\left( {n,m} \right)} = ^{- {{j2\pi}{({\frac{lm}{L} - \frac{kn}{K}})}}}}} & (49) \end{matrix}$

The discrete OTFS modulation defined above points to efficient implementation via discrete-and-periodic FFT type processing. However, it potentially does not provide insight into the time and bandwidth resolution of these operations in the context of two dimensional Fourier sampling theory. We next introduce continuous OTFS modulation and relate the more practical discrete OTFS as a sampled version of the continuous modulation.

Continuous OTFS modulation: Consider a two dimensional periodic function x(τ,v) with period [1/Δf, 1/T] that we wish to transmit. The choice of the period may seem arbitrary at this point, but the rationale for its choice will become apparent after the discussion below. Further, assume a multicarrier modulation system defined by

-   -   A lattice on the time frequency plane, that is a sampling of the         time axis with sampling period T and the frequency axis with         sampling period Δf (c.f. Eq. (9)).     -   Transmit and receive pulses g_(tr)(t), g_(tr)(t)∈L₂(R)         satisfying the bi-orthogonality property of (28)     -   A transmit windowing function W_(tr)[n,m]∈C(Λ) multiplying the         modulation symbols in the time-frequency domain

Given the above components, we define the continuous OTFS modulation via the following two steps

$\begin{matrix} {{X\left\lbrack {n,m} \right\rbrack} = {{W_{tr}\left\lbrack {n,m} \right\rbrack}{{SDFT}^{- 1}\left( {x\left( {\tau,\gamma} \right)} \right)}}} & (50) \end{matrix}$

s(t) = Π_(X)(g_(tr)(t))

The first equation describes the inverse discrete time-frequency symplectic Fourier transform [c.f. Eq. (36)] and the windowing function, while the second equation describes the transmission of the modulation symbols via a Heisenberg transform [c.f. Eq. (11)].

Continuous OTFS demodulation: Let us assume that the transmitted signal s(t) undergoes channel distortion according to (8), (2) yielding r(t) at the receiver. Further, let the receiver employ a receive windowing function W_(r)[n,m]∈C(Λ). Then, the demodulation operation consists of two steps:

-   -   (i) Evaluating the ambiguity function on Λ (Wigner transform) to         obtain estimates of the time-frequency modulation symbols

$\begin{matrix} {{Y\left\lbrack {n,m} \right\rbrack} = \left. {A_{{gr},y}\left( {\tau,\gamma} \right)} \right|_{|_{{\tau = {nT}},{\gamma = {m\; \Delta \; f}}}}} & (51) \end{matrix}$

-   -   (ii) Windowing and applying the symplectic Fourier transform on         the modulation symbols

$\begin{matrix} {{\hat{x}\left( {\tau,\gamma} \right)} = {{SDFT}\left( {{W_{r}\left\lbrack {n,m} \right\rbrack}{Y\left\lbrack {n,m} \right\rbrack}} \right)}} & (52) \end{matrix}$

Notice that in (51), (52) there is no periodization of Y[n,m], since the SDFT is defined on aperiodic square summable sequences. The periodization step needed in discrete OTFS can be understood as follows. Suppose we wish to recover the transmitted information symbols by performing a continuous OTFS demodulation and then sampling on the delay-Doppler grid

${\hat{x}\left( {l,k} \right)} = {{\hat{x}\left( {\tau,v} \right)}_{{\tau = \frac{m}{M\; \Delta \; f}},{v = \frac{n}{NT}}}}$

Since performing a continuous symplectic Fourier transform is generally not practical we consider whether the same result can be obtained using SFFT. The answer is that SFFT processing will produce exactly the samples we are looking for if the input sequence is first periodized (aliased). See also equation (40) and (41).

We have now described each of the steps of an exemplary form of OTFS modulation. We have also discussed how the Wigner transform at the receiver inverts the Heisenberg transform at the transmitter [c.f. Eqs. (27), (29)], and similarly for the forward and inverse symplectic Fourier transforms.

FIG. 5 illustratively represents an exemplary embodiment of OTFS modulation, including the transformation of the time-frequency plane to the Doppler-delay plane. In addition, FIG. 5 indicates relationships between sampling rate, delay resolution and time resolution. Referring to FIG. 5, in a first operation a Heisenberg transform translates a time-varying convolution channel in the waveform domain to an orthogonal but still time varying channel in the time frequency domain. For a total bandwidth BW and M subcarriers the frequency resolution is Δf=BW/M. For a total frame duration T_(f) and N symbols the time resolution is T=T_(f)/N.

In a second operation a SFFT transform translates the time-varying channel in the time-frequency domain to a time invariant one in the delay-Doppler domain. The Doppler resolution is 1/T_(f) and the delay resolution is 1/BW. The choice of window can provide a tradeoff between main lobe width (resolution) and side lobe suppression, as in classical spectral analysis.

Channel Equation in the OTFS Domain

A mathematical characterization of the end-to-end signal relationship in an OTFS system when a non-ideal channel is between the transmitter and receiver will now be provided. Specifically, this section demonstrates how the time varying channel in (2), (8), is transformed to a time invariant convolution channel in the delay Doppler domain.

Proposition 3: Consider a set of NM QAM information symbols arranged in a 2D periodic sequence x[l,k] with period [M,N]. The sequence x[k,l] undergoes the following transformations:

-   -   It is modulated using the discrete OTFS modulation of Eq. (45).     -   It is distorted by the delay-Doppler channel of Eqs.(2), (8).     -   It is demodulated by the discrete OTFS demodulation of Eqs.         (46), (48).

The estimated sequence {circumflex over (x)}[l,k] obtained after demodulation is given by the two dimensional periodic convolution

$\begin{matrix} {{\hat{x}\left\lbrack {l,k} \right\rbrack} \simeq {\frac{1}{MN}{\sum\limits_{m = 0}^{M - 1}{\sum\limits_{n = 0}^{N - 1}{{x\left\lbrack {m,n} \right\rbrack}{h_{W}\left( {\frac{l - m}{M\; \Delta \; f},\frac{k - n}{NT}} \right)}}}}}} & (53) \end{matrix}$

of the input QAM sequence x[m,n] and a sampled version of the windowed impulse response h_(w)(·).

$\begin{matrix} {{h_{W}\left( {\frac{l - m}{M\; \Delta \; f},\frac{k - n}{NT}} \right)} = {{h_{W}\left( {\tau^{\prime},v^{\prime}} \right)}_{{\tau^{\prime} = \frac{l - m}{M\; \Delta \; f}},{v^{\prime} = \frac{k - n}{NT}}}}} & (54) \end{matrix}$

where h_(w)(τ′,v′) denotes the circular convolution of the channel response with a windowing function

$\begin{matrix} {{h_{w}\left( {\tau^{\prime},\gamma^{\prime}} \right)} = {\int{\int{^{- {j2\pi\gamma\tau}}{h\left( {\tau,\gamma} \right)}{w\left( {{\tau^{\prime} - \tau},{\gamma^{\prime} - \gamma}} \right)}{\tau}{\gamma}}}}} & (55) \end{matrix}$

To be precise, the window w(τ,v) is circularly convolved with a slightly modified version of the channel impulse response e

h(τ,v) (by a complex exponential) as can be seen in the equation. The windowing function w(τ,v) is the symplectic Fourier transform of the time-frequency window W[n,m]

$\begin{matrix} {{w\left( {\tau,v} \right)} = {\sum\limits_{m = 0}^{M - 1}{\sum\limits_{n = 0}^{N - 1}{{W\left\lbrack {n,m} \right\rbrack}^{- {{j2\pi}{({{vnT} - {\tau \; m\; \Delta \; f}})}}}}}}} & (56) \end{matrix}$

and where W[n,m] is the product of the transmit and receive window.

$\begin{matrix} {{W\left\lbrack {n,m} \right\rbrack} = {{W_{tr}\left\lbrack {n,m} \right\rbrack}{W_{r}\left\lbrack {n,m} \right\rbrack}}} & (57) \end{matrix}$

In many cases, the windows in the transmitter and receiver are matched, i.e.,

W_(tr)[n, m] = W₀[n, m]  and  W_(r)[n, m] = W₀^(*)[n, m], hence  W[n, m] = W₀[n, m]².

The window effect is to produce a blurred version of the original channel with a resolution that depends on the span of the frequency and time samples available. If one considers the rectangular (or trivial) window, i.e., W[n,m]=1, n=0, . . . , N−1, m=−M/2, . . . , M/2−1 and zero else, then its SDFT w(τ, v) in (56) is the two dimensional Dirichlet kernel with bandwidth inversely proportional to N and M.

There are several other uses of the window function. The system can be designed with a window function aimed at randomizing the phases of the transmitted symbols. This randomization may be more important for pilot symbols than data carrying symbols. For example, if neighboring cells use different window functions, the problem of pilot contamination is avoided.

Channel Estimation in the OTFS Domain

There is a variety of different ways a channel estimation scheme could be designed for an OTFS system, and a variety of different implementation options and details

A straightforward way to perform channel estimation entails transmitting a sounding OTFS frame containing a discrete delta function in the OTFS domain or, equivalently, a set of unmodulated carriers in the time frequency domain. From a practical standpoint, the carriers may be modulated with known, say BPSK, symbols which are removed at the receiver, as is common in many OFDM systems. FIG. 6 shows a discrete impulse in the OTFS domain which may be used for purposes of channel estimation.

However, this approach may be wasteful as the extent of the channel response is only a fraction of the full extent of the OTFS frame (1/T, 1/Δf). For example, in LTE systems 1/T≈15 KHz while the maximum Doppler shift f_(/max) is typically one to two orders of magnitude smaller. Similarly 1/Δf≈67 usec, while maximum delay spread τ_(max) is again one to two orders of magnitude less. We therefore can have a much smaller region of the OTFS frame devoted to channel estimation while the rest of the frame carries useful data. More specifically, for a channel with support (±f

±τ_(max)) we need an OTFS subframe of length (2f_(d,max)/T, 2τ_(max)/Δf).

In the case of multiuser transmission, each UE can have its own channel estimation subframe positioned in different parts of the OTFS frame. However, this channel estimation subframe may be relatively limited in size. For example, if τ_(max) is 5% of the extent of the delay dimension and f

_(max) is 5% of the Doppler dimesion, the channel estimation subframe need only be 5%×5%=0.25% of the OTFS frame.

Importantly, although the channel estimation symbols are limited to a small part of the OTFS frame, they actually sound the whole time-frequency domain via the corresponding two-dimensional time-frequency basis functions associated with these symbols.

A different approach to channel estimation is to devote pilot symbols on a subgrid in the time-frequency domain. The key question in this approach is the determination of the density of pilots that is sufficient for channel estimation without introducing aliasing. Assume that the pilots occupy the subgrid (n₀T,m₀Δf) for some integers n_(g),m₀. Recall that for this grid the SDFT will be periodic with period (1/n₀T, 1/m₀Δf). Then, applying the aliasing results discussed earlier to this grid, we obtain an alias-free Nyquist channel support region of (±f_(d,max)±τ_(max))=(±1/2n_(g)T_(s)±1/2m₀Δf). The density of the pilots can then be determined from this relation given the maximum support of the channel. The pilot subgrid should extend to the whole time-frequency frame, so that the resolution of the channel is not compromised.

OTFS Access: Multiplexing More Than One User

There are a variety of ways to multiplex several uplink or downlink transmissions in one OTFS frame. Here we will briefly review the following multiplexing methods:

-   -   Multiplexing in the OTFS delay-Doppler domain     -   Multiplexing in the time-frequency domain     -   Multiplexing in the code speading domain     -   Multiplexing in the spatial domain

1. Multiplexing in the delay-Doppler domain: This is potentially the most natural multiplexing scheme for downlink transmissions. Different sets of OTFS basis functions, or sets of information symbols or resource blocks, are given to different users. Given the orthogonality of the basis functions, the users can be separated at the UE receiver. The UE need only demodulate the portion of the OTFS frame that is assigned to it.

In contrast to conventional communication systems, in an OTFS system even a small subframe or resource block in the OTFS domain will be transmitted over the whole time-frequency frame via two-dimensional basis functions and will experience the average channel response. FIG. 7 illustrates this point by showing two different basis functions belonging to different users. Because of this, there is no compromise on channel resolution for each user, regardless of the resource block or subframe size.

In the uplink direction, transmissions from different users experience different channel responses. Hence, the different subframes in the OTFS domain will experience a different convolution channel. This can potentially introduce inter-user interference at the edges where two user subframes are adjacent, and would require guard gaps to eliminate it. In order to avoid this overhead, a different multiplexing scheme can be used in the uplink as explained next.

2. Multiplexing in the time frequency domain: In this approach, resource blocks or subframes are allocated to different users in the time-frequency domain. FIG. 8 illustrates this for a three user case. As shown in FIG. 8, a first user (U1) occupies the whole frame length but only half the available subcarriers. A second user (U2) and a third user (U3) occupy the other half subcarriers, and divide the total length of the frame between them.

Notice that in this case, each user employs a slightly different version of the OTFS modulation described. One difference is that each user performs an SFFT on a subframe (N_(t),M_(t)), N_(t)≦N_(r) M_(t)≦M. This reduces the resolution of the channel, or in other words reduces the extent of the time-frequency plane in which each user will experience its channel variation. On the other side, this also gives the scheduler the opportunity to schedule users in parts of the time-frequency plane where their channel is best.

If it is desired to extract the maximum diversity of the channel and allocate users across the whole time-frequency frame, users can be multiplexed via interleaving. In this case, one user occupies a subsampled grid of the time-frequency frame, while another user occupies another subsampled grid adjacent to it. FIG. 9 shows the same three users as in FIG. 8, but interleaved on the subcarrier dimension. Of course, interleaving is possible in the time dimension as well, and/or in both dimensions. The degree of interleaving, or subsampling the grid per user is only limited by the spread of the channel that must be accommodated.

3. Multiplexing in the time frequency spreading code domain: Assume that it is desired to design a random access PHY and MAC layer where users can access the network without having to undergo elaborate RACH and other synchronization procedures. There is a perceived need for such a system to support Internet of Things (IoT) deployments. OTFS can support such a system by assigning each user a different two-dimensional window function that is designed as a randomizer. In this embodiment the windows of different users are designed to be nearly orthogonal to each other and nearly orthogonal to time and frequency shifts. Each user then only transmits on one or a few basis functions and uses the window as a means to randomize interference and provide processing gain. This can result in a much simplified system that may be attractive for low cost, short burst type of IoT applications.

4.Multiplexing in the spatial domain: Finally, like other OFDM multicarrier systems, a multi-antenna OTFS system can support multiple users transmitting on the same basis functions across the whole time-frequency frame. The users are separated by appropriate transmitter and receiver beamforming operations.

Exemplary Implementations of OTFS Communication Systems

As discussed above, embodiments of Orthogonal Time Frequency Space (OTFS) modulation are comprised of a cascade of two transformations. The first transformation maps the two dimensional plane where the information symbols reside (and which may be termed the delay-Doppler plane) to the time frequency plane. The second transformation transforms the time frequency domain to the waveform time domain where the transmitted signal is actually constructed. This transform can be thought of as a generalization of multicarrier modulation schemes.

FIG. 10 illustrates components of an exemplary OTFS transceiver 1000. The OTFS transceiver 1000 can be used as one or both of the exemplary OTFS transceivers 315 illustrated in the communication system 300 of FIG. 3A. The OTFS transceiver 1000 includes a transmitter module 1005 that includes a pre-equalizer 1010, an OTFS encoder 1020 and an OTFS modulator 1030. The OTFS transceiver 1000 also includes a receiver module 1055 that includes a post-equalizer 1080, an OTFS decoder 1070 and an OTFS demodulator 1060. The components of the OTFS transceiver may be implemented in hardware, software, or a combination thereof. For a hardware implementation, the processing units may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, micro-controllers, microprocessors, other electronic units designed to perform the functions described above, and/or a combination thereof. The disclosed OTFS methods will be described in view of the various components of the transceiver 1000.

Referring again to FIG. 3A, in one aspect a method of OTFS communication involves transmitting at least one frame of data ([D]) from the transmitting device 310 to the receiving device 330 through the communication channel 320, such frame of data comprising a matrix of up to N² data elements, N being greater than 1. The method comprises convolving, within the OTFS transceiver 315-1, the data elements of the data frame so that the value of each data element, when transmitted, is spread over a plurality of wireless waveforms, each waveform having a characteristic frequency, and each waveform carrying the convolved results from a plurality of said data elements from the data frame [D]. Further, during the transmission process, cyclically shifting the frequency of this plurality of wireless waveforms over a plurality of times so that the value of each data element is transmitted as a plurality of cyclically frequency shifted waveforms sent over a plurality of times. At the receiving device 330, the OTFS transceiver 315-2 receives and deconvolves these wireless waveforms thereby reconstructing a replica of said at least one frame of data [D]. In the exemplary embodiment the convolution process is such that an arbitrary data element of an arbitrary frame of data ([D]) cannot be guaranteed to be reconstructed with full accuracy until substantially all of these wireless waveforms have been transmitted and received.

FIG. 11 illustrates a comparison of bit error rates (BER) predicted by a simulation of a TDMA system and an OTFS system. Both systems utilize a 16 QAM constellation. The simulation modeled a Doppler spread of 100 Hz and a delay spread of 3 microsec. As can be seen from the graphs, the OTFS system offers much lower BER than the TDMA system for the same signal-to-noise ratio (SNR).

Attention is now directed to FIG. 12, which is a flowchart representative of the operations performed by an OTFS transceiver 1200 which may be implemented as, for example, the OTFS transceiver 1000 (FIG. 10). The OTFS transceiver 1200 includes a transmitter including a modulator 1210 and a receiver including a demodulator 1220 and two-dimensional equalizer 1230. In operation, a transmitter of the OTFS transceiver 1200 receives a two-dimensional symbol stream in the form of an N×N matrix of symbols, which may hereinafter be referred to as a TF matrix:

x∈C^(N×N)

As is illustrated in FIG. 13, in one embodiment the modulator 1210 functions as an orthogonal map disposed to transform the two-dimensional TF matrix to the following transmitted waveform:

φ_(t) =M(x)=Σx(i,j)φ_(i,m) φ_(i,m)⊥φ_(e,j)

Referring to FIG. 14, the demodulator 1220 transforms the received waveform to a two-dimensional TF matrix in accordance with an orthogonal map in order to generate an output stream:

φ_(r) ├>y=D(φ_(r))

In one embodiment the OTFS transceiver 1200 may be characterized by a number of variable parameters including, for example, delay resolution (i.e., digital time “tick” or clock increment), Doppler resolution, processing gain factor (block size) and orthonormal basis function. Each of these variable parameters may be represented as follows.

Delay resolution (digital time tick):

${\Delta \; T} \in {R^{> 0}\left( {{\Delta \; T} = \frac{1}{Bw}} \right)}$

Doppler resolution:

${\Delta \; F} \in {R^{> 0}\left( {{\Delta \; F} = \frac{1}{Trans}} \right)}$

Processing gain factor (block size):

N>0

Orthonormal basis of C^(N×1) (spectral shapes):

U={u₁, u₂, . . . , u_(n)}

As is illustrated by FIG. 12, during operation the modulator 1210 takes a TF matrix x∈C^(N×N) and transforms it into a pulse waveform. In one embodiment the pulse waveform comprises a pulse train defined in terms of the Heisenberg representation and the spectral shapes:

$\varphi_{t} = {{M(x)} = \left( {\underset{\underset{b_{1}}{}}{\Pi (x)u_{1}},\underset{\underset{b_{2}}{}}{{\Pi (x)}u_{2}},\ldots \mspace{11mu},\underset{\underset{b_{N}}{}}{{\Pi (x)}u_{N}}} \right)}$

where b₁, b₂ . . . b_(N) are illustrated in FIG. 15 and where, in accordance with the Heisenberg relation:

Π(h*x)=Π(h)·Π(x) in particular:

Π(δ_((z,o)) *x)=L _(i)·Π(x)

Π(δ_(i 0,w)) *x)=M _(w)·Π(x)

The Heisenberg representation provides that:

${\Pi \text{:}\mspace{11mu} C^{N \times N}}\overset{\approx}{\rightarrow}{C^{N \times N}\mspace{14mu} {given}\mspace{14mu} {by}\text{:}}$ ${{\Pi (x)} = {\sum\limits_{\tau,{w = 0}}^{N - 1}{{x\left( {\tau,w} \right)}M_{w}L_{\tau}}}},{x \in C^{N \times N}}$

where L_(t) and M_(w) are respectively representative of cyclic time and frequency shifts and may be represented as:

L_(τ) ∈ C^(N × N):  L_(τ)(ϕ)(t) = ϕ(t + τ), τ = 0, …  , N − 1 ${{M_{w} \in {C^{N \times N}\text{:}\mspace{14mu} {M_{w}(\phi)}(t)}} = {^{\frac{j\; 2\; \pi}{N}w\; t}{\phi (t)}}},{w = 0},\ldots \mspace{14mu},{N - 1}$

The demodulator 1220 takes a received waveform and transforms it into a TF matrix y∈C^(N×N) defined in terms of the Wigner transform and the spectral shapes:

φ_(r) = (b₁, b₂, …  , b_(N)) ${y\left( {\tau,w} \right)} = {{{D\left( \varphi_{r} \right)}\left( {\tau,w} \right)} = \overset{\overset{{Wigner}\mspace{14mu} {transform}}{}}{\frac{1}{N}{\sum\limits_{n = 1}^{N}{\langle{{M_{w}L_{\tau}u_{n}},b_{n}}\rangle}}}}$

Main property of M and D (Stone von Neumann theorem):

D(h^(a)M(x)) = h * x  where: h(τ, w) ≈ a(τΔ T, w Δ F) h(τ, w)≈a(τΔT, wΔF)

As illustrated in FIG. 16, the equalizer 1230 may be implemented as a two-dimensional decision feedback equalizer configured to perform a least means square (LMS) equalization procedure such that:

y ↦ x̂

Transmitter Grid and Receiver Bin Structure

Attention is now directed to FIGS. 17A-17D, which depict an OTFS transmitter 102 and receiver 104 to which reference will be made in describing the transmission and reception of OTFS waveforms. More specifically, FIGS. 17B-17D illustrate the transmission and reception of OTFS waveforms relative to a time-frequency transmitter grid or series of bins and a corresponding time-frequency receiver grid or series of bins. As will be discussed below, the receiver 104 will generally operate with respect to a time-frequency receive grid of a finer mesh than that of the time-frequency transmit grid associated with the transmitter 102.

Turning now to FIG. 17A, the transmitter 102 and receiver 104 are separated by an impaired wireless data channel 100 including one or more reflectors 106. As shown, the reflectors 106 may reflect or otherwise impair waveforms (112, 114 a, 114 b) as they travel through the data channel 100. These reflectors may be inherently represented by the two-dimensional (2D) channel state of the channel 100 (see, e.g., the finite channel h_(eqv,f) of FIG. 18).

In one embodiment the transmitter 102 includes a transmitter processor 102 p to package input data into at least one N×M array of data symbols. An encoding process is then used to transmit this array of data symbols in accordance with the OTFS modulation techniques described herein. The transmitted OTFS waveforms are received by a receiver 104, which includes a receiver processor 104 p. In one embodiment the receiver processor 104 p utilizes information pertaining to the 2D state of the channel 100 to enable these OTFS waveforms to be decoded and recover the transmitted data symbols. Specifically, the receiver processor 104 p may use an inverse of the OTFS encoding process to decode and extract this plurality of data symbols. Alternatively the correction of signals for data channel impairments can be done after the receiver has decoded and extracted the plurality of data symbols.

In some embodiments OTFS data transmission may be implemented by transforming the input N×M array of data symbols into at least one block or array of filtered OFDM symbols. This can be done, for example, using one dimensional Fourier transforms and a filtering process or algorithm. This block or array of filtered OFDM symbols may then be transformed into at least one block or array of OFTS symbols using various types of two dimensional Fourier transforms. These results will typically be stored in transmitter memory 102 m. The stored results can then be communicated over wireless frequency sub-bands by various methods. For example, in one embodiment a transmitter 102 c that employs a series of M narrow-band filter banks may be utilized. In this implementation the transmitter 102 c produces a series of M mutually orthogonal waveforms transmitted over at least N time intervals.

In one embodiment gaps or “guard bands” in both time and frequency may be imposed to minimize the possibility of inadvertent cross talk between the various narrow-band filters and time intervals prior to transmission. Depending on the characteristics of the data channel, any such gaps or guard bands can be increased or decreased or set to zero as situations warrant.

Alternatively, the OTFS encoding process may encode the N×M array of data symbols onto a manifold compatible with symplectic analysis. The symbols may be distributed over a column time axis of length T and row frequency axis of length F, thereby producing at least one information manifold for storage in transmitter memory 102 m.

The information manifold effectively holds information corresponding to the input data symbols in a form enabling them to be subsequently transformed in accordance with the desired OTFS transformation operation such as, for example, a symplectic 2D Fourier transform, a discrete symplectic 2D Fourier transform, a finite symplectic Fourier transform, and the like. In certain embodiments the data symbols may also be spread prior to being held within an information manifold.

The OTFS processor 102 p may then transform the information manifold according to a 2D symplectic Fourier transform. This transformation may be effected using any of the previously discussed symplectic 2D Fourier transforms, discrete symplectic 2D Fourier transforms, and finite symplectic Fourier transforms. This operation produces at least one 2D Fourier transformed information manifold, which may be stored in transmitter memory 102 m.

The OTFS transmitter 102c will typically transmit this at least one 2D Fourier transformed information manifold as a series of “M” simultaneous narrow band waveforms, each series over consecutive time intervals, until the entire 2D Fourier transformed information manifold has been transmitted. For example, the transmitter processor 102 p can operate, often on a one column at a time basis, over all frequencies and times of this 2D Fourier transformed information manifold. The transmitter processor 102 p can select a given column at location n (where n can vary from 1 to N) and transmit a column with a width according to a time slice of duration proportional to Tμ, where μ=1/N. Those frequencies in the column slice of this 2D Fourier transformed information manifold (e.g. frequencies corresponding to this transmitting time slice) may then be passed through a bank of at least M different, nonoverlapping, narrow-band frequency filters. This produces M mutually orthogonal waveforms. The processor 102 p can then cause these resulting filtered waveforms to be transmitted, over different transmitted time intervals (e.g. one column at a time), as a plurality of at least M mutually orthogonal waveforms until an entire 2D Fourier transformed information manifold has been transmitted.

In one embodiment gaps or “guard bands” in both time and frequency may be imposed to minimize the possibility of inadvertent cross talk between the various narrow-band filters and time intervals prior to transmission. Depending on the characteristics of the data channel, any such gaps or guard bands can be increased or decreased or set to zero as situations warrant.

Each OTFS receiver 104 may then receive a channel-convoluted version of the 2D Fourier transformed information manifold transmitted by the transmitter 102. Due to distortions introduced by the channel 100, the M narrow band waveforms originally transmitted at M original frequencies may now comprise more than M narrow band waveforms at a different range of frequencies. Moreover, due to transmitted OTFS waveforms impinging various reflectors 106, the originally transmitted signals and reflections thereof may be received at different times. As a consequence, each receiver 104 will generally supersample or oversample the various received waveforms on a time-frequency grid having a finer mesh than that associated with the transmitter 102. This oversampling process is represented by FIGS. 17B-17D, which depict a receiver time-frequency grid having smaller time and frequency increments than the transmitter OTFS grid.

Each OTFS receiver 104 operates to receive the transmitted 2D Fourier transformed information manifold over time slices having durations that are generally less than or equal to the transmission time intervals employed by the transmitter 102. In one embodiment the receiver 104 analyzes the received waveforms using a receiving bank of at least M different, non-overlapping, narrow-band frequency filters. The receiver will then generally store the resoling approximation (channel convoluted version) of the originally transmitted 2D Fourier transformed information manifold in receiver memory 104 m.

Once the waveforms transmitted by the transmitter 102 have been received, the receiver 104 then corrects for the convolution effect of the channel 100 in order to facilitate recovery of an estimate of the originally transmitted data symbols. The receiver 104 may effect these corrections in a number of ways.

For example, the receiver 104 may use an inverse of the 2D symplectic Fourier transform used by the transmitter 102 to transform the received waveforms into an initial approximation of the information manifold originally transmitted. Alternatively, the receiver 104 may first use information pertaining to the 2D channel state to correct the channel-convoluted approximation of the transmitted 2D Fourier transformed information manifold (stored in receiver memory). Following this correction the receiver 104 may then use the inverse of the 2D symplectic Fourier transform employed at the transmitter 102 to generate a received information manifold and subsequently extract estimated data symbols.

Although the OTFS methods described herein inherently spread any given data symbol over the entire time-frequency plane associated with a transmitter, in some embodiments it may be useful to implement an additional spreading operation to insure that the transmitted data symbols are uniformly distributed. This spreading operation may be carried out by the transmitter processor 102 p either prior to or after encoding the input N×M 2D array of data symbols onto the symplectic analysis compatible manifold. A number of spreading functions such as, for example, a 2D chirp operation, may be used for this purpose. In the event such a spreading operation is implemented at the transmitter 102, the receiver 104 will utilize an inverse of this spreading operation in order to decode and extract the data symbols from the various received information manifolds.

FIG. 19 illustrates transmission of a 2D Fourier transformed information manifold represented by an N×M structure over M frequency bands during N time periods of duration Tμ. In this example, each of the M frequency bands is represented by a given row and each different time period is represented by a given column. In the embodiment of FIG. 19 it is assumed that the OTFS transmitter is configured to transmit OTFS signals during without guard intervals over the allocated bandwidth, which encompasses the M frequency bands. The bandwidth (ω₀) of each of the M frequency bands is, is 1/Tμ. Accordingly, if it is desired to transmit all N columns of information over a minimum time interval of N*Tμ, then M must have a bandwidth no larger than 1/Tμ and the bandwidth used by all M filtered OTFS frequency bands cannot exceed M/T, where T is the total amount of time used to transmit all N columns of the 2D Fourier transformed information manifold.

At the receiver 104, the various 2D Fourier transformed information manifolds may be received using banks of different, nonoverlapping, narrow-band frequency filters that are generally similar to those used by the transmitter 102. Again, the receiver time slices and receiving banks of filters will generally operate with finer granularity; that is, the receiver will typically operate over smaller frequency bandwidths, and shorter time slices, but over a typically broader total range of frequencies and times. Thus the receiver bin structure will preferably oversample the corresponding transmitting time slices and transmitting banks of different, non-overlapping, narrow-band frequency filters previously used by the transmitter.

As may be appreciated with reference to FIG. 19, the OTFS transmitter will typically transmit the resulting filtered waveforms (in this example over all rows and successive columns), until the entire 2D Fourier transformed information manifold has been transmitted. However the transmitter can either transmit the successive columns (time slices) continuously and contiguously that is without any time gaps in-between, as more of a series of continuous longer duration waveforms, or alternatively the transmitter can put some time spacing between the various successive columns, thus creating a more obvious series of waveform bursts.

Stated differently, the transmitter can transmit the resulting filtered waveforms as either: 1) a plurality of at least M simultaneously transmitted mutually orthogonal waveforms over either different consecutive transmitted time intervals; or 2) a plurality OTFS data or OTFS pilot bursts comprising at least M simultaneously transmitted mutually orthogonal waveform bursts over different transmitted intervals separated by at least one spacer time interval.

FIG. 20 shows an example of the M filtered OTFS frequency bands being simultaneously transmitted according to various smaller time slices Tμ. The repeating curved shapes show the center frequency for each filtered band according to g(t·e

0). One of the transmitted bins of frequency bandwidth, which is of size 1/T and time duration T*μ, is shown in more detail. Again, as previously discussed, in a preferred embodiment the OTFS receiver will use oversampling, and thus use finer granularity bins that nonetheless may extend over a broader range of times and frequencies so as to catch signals with high degrees of delay or Doppler frequency shift.

Stated differently, in some embodiments, the non-overlapping, narrow-band frequency filters used at the transmitter may be configured to pass frequencies from the various 2D Fourier transformed Information manifolds that are proportional to a filter function g(t·g

), where j is the square root of −1, t corresponds to a given time slice of duration Tμ chosen from a 2D Fourier transformed information manifold, and k corresponds to a given row position in a given 2D Fourier transformed information manifold, where k varies between 1 and M. In this example, the bandwidth, ω₀, in frequency units Hz, can be proportional to 1/T, and T=M/(allowed wireless bandwidth).

As may be appreciated from FIGS. 19 and 20, the various 2D Fourier transformed information manifolds can have overall dimensions NT_(μ)according to a time axis and M/T according to a frequency axis, and each “cell” or “bin” in the various 2D Fourier transformed information manifold may have overall dimensions proportional to Tμ according to a time axis and 1/T according to a frequency axis.

FIG. 21 provides another example of OTFS waveforms being transmitted according to various smaller time slices Tμ. In the illustration of FIG. 21 the amplitude or extent of modulation of the various waveforms as a function of time is also shown.

In some embodiments it may be useful to modulate the transmitted wireless OTFS waveforms using an underlying modulation signal that allows the receiver to distinguish where, on the original 2D time and frequency grid, a given received signal originated. This may, for example, assist an OTFS receiver in distinguishing the various types of received signals, and in distinguishing direct signals from various time delayed and/or frequency shifted reflected signals. In these embodiments grid, bin, or lattice locations of the originally transmitted OTFS waveforms may be distinguished by determining time and frequency related parameters of the received waveforms. For example, in the presently discussed “symplectic” implementations, where each “row” of the 2D Fourier transformed information manifold is passed through a narrow band filter that operates according to parameters such as g(t·e

0), the “kω₀” term may enable the receiver to distinguish any given incoming OTFS waveform by its originating “column” location “t”. In this case the receiver should also be able to determine the bin (grid, lattice) location of the various received waveforms by determining both the t (time related) and k (frequency related) values of the various received waveforms. These values may then be used during subsequent deconvolution of the received signals.

If further distinguishability of the bin (grid lattice) originating time and frequency origins of the received OTFS signals is desired, then an additional time and/or frequency varying modulation scheme may also be imposed on the OTFS signals, prior to transmission, to allow the OTFS receiver to further distinguish the bin (grid, lattice) origin of the various received signals.

In alternative embodiments either the information manifold or the 2D Fourier transformed information manifolds may be sampled and modulated using Dirac comb methods. The Dirac combs utilized by these methods may be, for example, a periodic tempered distribution constructed from Dirac delta functions.

Attention is now directed to FIG. 22, which provides a block diagrammatic representation of an exemplary process 2200 of OTFS transmission and reception in accordance with the present disclosure. The process 2200 begins with the packaging of data for transmission and its optional precoding to correct for known channel impairments (stage 2210). This material is then processed by a 2D Fourier Transform (such as a symplectic Fourier transform, discrete symplectic Fourier transform, or finite symplectic Fourier transform) (stage 2220). Following this processing the results are then passed through a filter bank (FB) and transmitted over a series of time intervals Tμ (stage 2230). The transmitted wireless OTFS waveforms then pass through the communications or data channel (C), where they are subject to various distortions and signal impairments (stage 2240). At the receiver, the received waveforms are received according to a filter bank at various time intervals (stage 2250). The receiver filter bank (FB*) may be an oversampled filter bank (FB*) operating according to oversampled time durations that may be a fraction of the original time intervals Tμ. This oversampling enables the received signals to be better analyzed for channel caused time delays and frequency shifts at a high degree of resolution. At a stage 2260 the received material is analyzed by an inverse 2D Fourier Transform (2D-FTs) (which again may be an inverse symplectic Fourier transform, inverse discrete symplectic Fourier transform, or inverse finite symplectic Fourier transform). The results may then be further corrected for channel distortions using, for example, 2D channel state information (stage 2270). In other embodiments stage 2270 may precede stage 2260.

Further Mathematical Characterization of OTFS Modulation and Derivation of the Two-Dimensional (2D) Channel Model

In what follows we further develop the OTFS communication paradigm focusing on the central role played by the Heisenberg representation and the two dimensional symplectic Fourier transform. A principal technical result of this development is a rigorous derivation of the OTFS two-dimensional channel model.

0. Introduction

Orthogonal time frequency space is a novel modulation scheme capable of being implemeneted by communication transceivers that converts the dynamic one dimensional wireless medium into a static two dimensional local ISI channel by putting the time and frequency dimensions on an equal footing. Among the primary benefits of an OTFS transceiver relative to a conventional transceiver are the following:

-   -   1. Fading. Elimination of fading both time and frequency         selective.     -   2. Diversity. Extraction of all diversity branches in the         channel.     -   3. Stationarity. All symbols experience the same distortion.     -   4. CSI. Perfect and efficient channel state information (CSI).

In a sense, the OTFS transceiver establishes a virtual wire through a communication medium, thus allowing the application of conventional wired DSP technologies in the wireless domain. Embodiments of the OTFS transceiver are based on principles from representation theory, generalizing constructions from classical Fourier theory. On the operational level, OTFS may be roughly characterized as an application of the two dimensional Fourier transform to a block of filtered OFDM symbols. OTFS is a true two dimensional time-frequency modulation, and may incorporate both two dimensional time-frequency filtering and two dimensional equalization techniques. In what follows we provide a formal mathematical development of the OTFS transceiver, focusing on a rigorous derivation of the two dimensional channel model.

OTFS and Lattices

We first choose an undersampled time-frequency lattice, that is, a two dimensional lattice of density smaller or equal than 1. The undersampling condition is essential for perfect reconstruction, however, it seems to limit the delay-Doppler resolution of the channel acquisition. In contrast, radar theory amounts to choosing an oversampled time frequency lattice of density greater or equal than 1 where the oversampling condition is essential for maximizing the delay-Doppler resolution of target measurement. As it turns out, the symplectic (two dimensional) Fourier transform intertwines between communication and radar lattices. The OTFS communication paradigm is to multiplex information symbols on an oversampled high resolution radar lattice and use the symplectic Fourier transform together with two dimensional filtering to convert back to communication coordinates. This allows OTFS to reap the benefits of both worlds—high resolution delay—Doppler channel state measurement without sacrificing spectral efficiency. In particular, the OTFS channel model may be thought of as a high resolution delay-Doppler radar image of the wireless medium.

The Wireless Channel

In order to understand OTFS, it is benefical to understand the wireless channel as a mathematical object. Let H=L²(R) denote the vector space of “physical” waveforms defined on the time domain. The physics of the wireless medium is governed by the phenomena of multipath reflection, that is, the transmitted signal is propagating through the atmosphere and reflected from various objects in the surrounding. Some of the objects, possibly including the transmitter and the receiver, are moving at a non-zero velocity. Consequently, (under some mild “narrow band” assumption) the received signal is a superposition of time delays and Doppler shifts of the transmitted signal where the delay in time is caused by the excess distance transversed by the reflected waveform and the Doppler shift is caused by the relative velocity between the reflector and the transmitting and/or receiving antennas. Mathematically, this amounts to the fact that the wireless channel can be expressed as a linear transformation C:H→H realized as a weighted superposition of multitude of time delays and Doppler shifts, namely:

$\begin{matrix} {{{{C(\phi)}(t)} = {\int_{\tau}{\int_{v}{{h\left( {\tau,v} \right)}^{2\; \pi \; \; {v{({t - \tau})}}}{\phi \left( {t - \tau} \right)}{\tau}{v}}}}},} & (0.1) \end{matrix}$

for every transmit waveform φ∈H. From Equation (0.1) one can see that the channel C is determined by the function h that depends on two variables τ and v, referred to as delay and Doppler. The pair (τ, v) can be viewed as a point in the plane V=R², referred to as the delay Doppler plane. Consequently, h is a kind of a two dimensional (delay Doppler) impulse response characterizing the wireless channel. However, one should keep in mind that this terminology is misleading since the action of h given by (0.1) is not a convolution action.

Fading

One basic physical phenomena characteristic to the wireless channel is fading. The phenomena of fading corresponds to local attenuation in the energy profile of the received signal as measured over a specific dimension. It is customary to consider two kind of fadings: time selective fading and frequency selective fading. The first is caused by destructive superposition of Doppler shifts and the second is caused by destructive superposition of time delays. Since the wireless channel consists of combination of both time delays and Doppler shifts it exhibits both types of fading. Mitigating the fading phenomena is a significant motivation behind the development of the OTFS transceiver.

The Heisenberg Representation

One key observation is that the delay Doppler channel representation given in Equation (0.1) is the application of a fundamental mathematical transform, called the Heisenberg representation, transforming between functions on the delay Doppler plane V and linear operators on the signal space H. To see this, let us denote by L_(τ) and M _(v) are the operations of time delay by τ and Doppler shift by v respectively, that is:

L _(τ)(φ)(t)=φ(t−τ),

M _(v)(φ)(t)=e ^(2πivt)φ(t),

for every φ∈H. Using this terminology, we can rewrite channel equation (0.1) in the following form:

$\begin{matrix} \begin{matrix} {{{C(\phi)}(t)} = {\int_{\tau}^{\;}{\int_{v}{{h\left( {\tau,v} \right)}L_{\tau}{M_{v}(\phi)}{\tau}{v}}}}} \\ {= {\left( {\int_{\tau}^{\;}{\int_{v}{{h\left( {\tau,v} \right)}L_{\tau}M_{v}{\tau}{v}}}} \right){(\phi).}}} \end{matrix} & (0.2) \end{matrix}$

Let us define the Heisenberg representation to be the transform taking a function a: V−→C to the linear operator Π(a): H→H, given by:

$\begin{matrix} {{\Pi (a)} = {\int_{\tau}^{\;}{\int_{v}{{a\left( {\tau,v} \right)}L_{\tau}M_{v}{\tau}{{v}.}}}}} & (0.3) \end{matrix}$

We refer to the function a as the delay Doppler impulse response of the operator Π(a). Taking this perspective, we see that the wireless channel is an application of the Heisenberg representation to a specific function h on the delay Doppler plane. This higher level of abstraction establishes the map Π as the fundamental object underlying wireless communication. In fact, the correspondence a⇄Π(a) generalizes the classical correspondence between a stationary linear system and a one dimensional impulse response to the case of arbitrary time varying systems (also known as linear operators). In this regard, the main property of the Heisenberg representation is that it translates between composition of linear operators and an operation of twisted convolution between the corresponding impulse responses. In more details, if:

A=Π(a),

B=Π(b),

then we have:

A∘B=Π(a* _(t) b),   (0.4)

where *_(t) is a non commutative twist of two dimensional convolution. Equation (0.4) is key to the derivation of the two dimensional channel model—the characteristic property of the OTFS transceiver.

The OTFS Transceiver and the 2D Channel Model

The OTFS transceiver provides a mathematical transformation having the effect of converting the fading wireless channel into a stationary two dimensional convolution channel. We refer to this property as the two dimensional channel model.

Formally, the OTFS transceiver may be characterized as a pair of linear transformations (M,D) where M is termed a modulation map and D is termed a demodulation map and is the inverse of M. According to the OTFS paradigm the information bits are encoded as a complex valued function on V which periodic with respect to a lattice Λ^(⊥)⊂V called the reciprocal communication lattice. Note that the term “reciprocal” is used to suggest a type of duality relation between Λ^(⊥) and a more conventional lattice Λ, called the primal communication lattice. If we denote by C(V)_(Λ) _(⊥) the vector space of Λ^(⊥)-periodic functions on V then the OTFS modulation is a linear transformation:

M: C(V)_(Λ) _(⊥) →H   (0.5)

Geometrically, one can think of the information as a function on a two dimensional periodic domain (a donut) obtained by folding V with respect to the lattice Λ^(⊥). Respectively, the demodulation map is a linear transformation acting in the opposite direction, namely:

D: H→C(V)_(Λ) _(⊥) .   (0.6)

The precise mathematical meaning of the two dimensional channel model is that given an information function x∈C(V)_(Λ) _(⊥) , we have:

D∘C∘M(x)=c*x,   (0.7)

where * stands for periodic convolution on the torus and the function c is a periodization with respect to the reciprocal lattice Λ^(⊥) of the delay Doppler impulse response h of the wireless channel, that is:

c=per_(Λ) _(⊥) (h).   (0.8)

Equations (0.7) and (0.8) encodes the precise manner of interaction between the OTFS transceiver and the wireless channel.

The remainder of this explanation of OTFS method and the OTFS transceiver is organized as follows:

Section 1 discusses several basic mathematical structures associated with the delay Doppler plane V. We begin by introducing the symplectic form on V which is an antisymmetric variant of the more familiar Euclidean form used in classical signal processing. We than discuss lattices which are two dimensional discrete subdomains of V. We focus our attention to the construction of the reciprocal lattice. The reciprocal lattice plays a pivotal role in the definition of the OTFS transceiver. We than proceed to discuss the dual object of a lattice, called a torus, which is a two dimensional periodic domain obtained by folding the plain with respect to a lattice.

Section 2 discusses the symplectic Fourier transform, which is a variant of the two dimensional Fourier transform defined in terms of the symplectic form on V. We discuss three variants of the symplectic Fourier transform: the continuous, the discrete and the finite. We explain the relationships between these variants.

Section 3 discusses the Heisenberg representation and its inverse—the Wigner transform. In a nutshell, the Heisenberg representation is the structure that encodes the precise algebraic relations between the operations of time delay and Doppler shifts. We relate the Wigner transform to the more familiar notions of the ambiguity function and the cross ambiguity function. We conclude with a formulation of the fundamental channel equation.

Section 4 discusses the continuous variant of the OTFS transceiver. We begin by specifying the parameters defining the OTFS transceiver. Then we proceed to define the modulation and demodulation maps. We conclude the section with a derivation of the two dimensional channel model from first principles.

Section 5 discusses the finite variant of the OTFS transceiver. In a nutshell, the finite variant is obtained from the continuous variant by sampling the reciprocal torus along finite uniformly distributed subtorus. We define the finite OTFS modulation and demodulation maps. We then formulate the finite version of the two dimensional channel model, explaining the finite two dimensional impulse response is the restriction of the continuous one to the finite subtorus. We conclude this section with an explicit interpretation of the modulation formula in terms of classical DSP operations.

1. The Delay-Doppler Plane

1.1 The Symplectic Plane

The delay Doppler plane is a two dimensional vector space over the real numbers. Concretely, we take V=R² where the first coordinate is delay, denoted by τ and the second coordinate is Doppler, denoted by v. The delay Doppler plane is equipped with an intrinsic geometric structure encoded by a symplectic form (also called symplectic inner product or symplectic pairing). The symplectic form is a pairing ω:V×V→R defined by the determinant formula:

$\begin{matrix} {{{\omega \left( {v^{\prime},v} \right)} = {{- {\det \begin{bmatrix} \tau & \tau^{\prime} \\ v & v^{\prime} \end{bmatrix}}} = {{v\; \tau^{\prime}} - {\tau \; v^{\prime}}}}},} & (1.1) \end{matrix}$

where v=(τ, v) and v′=(τ′, v′). Note that the symplectic form, in contrast to its Euclidean counterpart, is anti-symmetric, namely ω(v,v′)=−ω(v′,v) for every v,v′∈V. Consequently, the symplectic product of a vector with itself is always equal zero, that is ω(v, v)=0, for every v∈V. As it turns out, the fabric of time and frequency is governed by a symplectic structure.

1.1.1 Functions on the plane. We denote by C(V) the vector space of complex valued functions on V. We denote by * the operation of linear convolution of functions on V. Given a pair of functions ƒ, g ∈ C(V), their convolution is defined by:

$\begin{matrix} \begin{matrix} {{f*{g(v)}} = {\int_{{v_{1} + v_{2}} = v}{{f\left( v_{1} \right)}{g\left( v_{2} \right)}}}} \\ {{= {\int_{v^{\prime} \in V}{{f\left( v^{\prime} \right)}{g\left( {v - v^{\prime}} \right)}{v^{\prime}}}}},} \end{matrix} & (1.2) \end{matrix}$

for every v∈V.

1.2 Lattices

A lattice Λ⊂V is a commutative subgroup isomorphic to Z² defined as follows:

$\begin{matrix} {\Lambda = {{Zv}_{1} \oplus {Zv}_{2}}} \\ {{= \left\{ {{{av}_{1} + {{bv}_{2}\text{:}a}},{b \in Z}} \right\}},} \end{matrix}$

where v₁, v₂ ∈ V are linear independent vectors. In words, Λ consists of all integral linear combinations of the vectors v₁ and v₂ . See FIG. 23. The vectors v₁ and v₂ are called generators of the lattice. The volume of Λ is, by definition, the volume of a fundamental domain. One can show that:

vol(Λ)=|ω(v ₁ , v ₂)|.   (1.3)

when vol(Λ)≧1 the lattice is called undersampled and when vol(Λ)≧1 the lattice is called oversampled. Finally, in case vol(Λ)=1 the lattice is called critically sampled.

EXAMPLE 1.1 Standard Communication Lattice

Fix parameters T≧0 and μ≧1. Let:

$\begin{matrix} \begin{matrix} {\Lambda_{T,\mu} = {{{ZT}\; \mu} \oplus {Z\; {1/T}}}} \\ {= {\left\{ {{\left( {{{K \cdot T}\; \mu} + {L \cdot {1/T}}} \right)\text{:}K},{L \in Z}} \right\}.}} \end{matrix} & (1.4) \end{matrix}$

We have that vol(Λ_(T,μ))=μ. We refer to Λ_(T,μ) as the standard communication lattice.

1.2.1 Reciprocal lattice. Given a lattice Λ⊂V, its orthogonal complement lattice is defined by:

Λ^(⊥) ={v∈V:ω(v,λ)∈Zforeveryλ∈Λ}.   (1.5)

In words, Λ^(⊥) consists of all vectors in V such that their symplectic pairing with every vector in Λ is integral. One can show that Λ^(⊥) is indeed a lattice. We refer to Λ^(⊥) as the reciprocal lattice of Λ. One can show that:

vol(Λ^(⊥))=1/vol(Λ),   (1.6)

which implies that Λ is undersampled if and only if Λ^(⊥) is oversampled. This means that reciprocity interchanges between coarse (undersampled) lattices and fine (oversampled) lattices. Another attribute concerns how lattice inclusion behaves under reciprocity. Given a pair consisting of a lattice Λ⊂V and a sublattice Λ₀⊂Λ, one can show that the inclusion between the reciprocals is reversed, that is:

Λ^(⊥)⊂Λ₀ ^(⊥).   (1.7)

EXAMPLE 1.2 Consider the Standard Communication Lattice Λ_(t,μ)

Its reciprocal is given by:

(Λ_(T,μ))⁻⁼ ZT⊕Z1/Tμ.   (1.8)

See FIGS. 24A and 24B, which respectively illustrate a standard communication lattice and the reciprocal of the standard communication lattice. Indeed, we have that:

${\omega \left( {\begin{bmatrix} {KT} \\ {{L/T}\; \mu} \end{bmatrix},\begin{bmatrix} {K^{\prime}T\; \mu} \\ {L^{\prime}/T} \end{bmatrix}} \right)} = {{{LK}^{\prime} - {KL}^{\prime}} \in {Z.}}$

Note that vol(Λ_(T,μ))^(⊥)=1/μ which means that as the primal lattice becomes sparser, the reciprocal lattice becomes denser.

1.2.2 Functions on a lattice. We denote by C(Λ) the vector space of complex valued functions on the lattice. We denote by R^(Λ): C(Λ)→C(Λ) the canonical restriction map, given by:

R ^(Λ)(ƒ)(λ)=ƒ(λ),

for every ƒ∈C(V) and λ∈Λ. We denote by * the convolution operations between functions on Λ. Given ƒ, g∈C(Λ), their convolutions is defined by:

$\begin{matrix} \begin{matrix} {{f*{g(\lambda)}} = {\sum\limits_{{\lambda_{1} + \lambda_{2}} = \lambda}{{f\left( \lambda_{1} \right)}{g\left( \lambda_{2} \right)}}}} \\ {{= {\sum\limits_{\lambda^{\prime} \in \Lambda}{{f\left( \lambda^{\prime} \right)}{g\left( {\lambda - \lambda^{\prime}} \right)}}}},} \end{matrix} & (1.9) \end{matrix}$

for every λ∈Λ.

1.3 Tori A torus Z is a two dimensional periodic domain that constitutes the geometric dual of a lattice Λ. Formally, Z is the continuous group obtained as the quotient of the vector space V by the lattice Λ, namely:

Z=V/Λ.   (1.10)

In particular, a point z∈Z is by definition a Λ-coset in V, namely:

z=v+Λ,   (1.11)

for some v∈V. An alternative, albeit less canonical, way to construct Z is to glue opposite faces of a fundamental domain of Λ. Geometrically, Z has the shape of a “donut” obtained by folding the plane V with respect to the lattice Λ. We refer to Z as the torus associated with Λ or sometimes also as the dual of Λ. Note that a torus is the two dimensional counterpart of a circle, where the second is obtained by folding the line R with respect to a one dimensional lattice ZT⊂R.

EXAMPLE 1.3 Standard Communication Torus

As shown in FIG. 25, the torus associated with the standard communication lattice Λ_(T,μ) is given by:

$\begin{matrix} \begin{matrix} {Z_{T,\mu} = {V/\Lambda_{T,\mu}}} \\ {\left. {{{{{= {{{R/{ZT}}\; \mu} \oplus {{R/Z}\; {1/T}}}};}\left\lbrack {0,{T\; \mu}} \right)} \times 0},{1/T}} \right).} \end{matrix} & (1.12) \end{matrix}$

Geometrically, Z_(T,μ) is the Cartesian product of two circles; one of diameter Tμ and the other of diameter 1/T. We refer to Z_(T,μ) as the standard communication torus.

1.3.1 Functions on tori. We denote by C(Z) the vector space of complex valued functions on a torus Z=V/Λ. A function on Z is naturally equivalent to a function ƒ:V→C periodic with respect to translations by elements of the lattice Λ, that is:

ƒ(v+λ)=ƒ(v),   (1.13)

for every v∈V and λ∈Λ. Hence, the vector space of functions on Z coincides with the subspace of Λ periodic functions on V, that is, C(Z)=C(V)_(Λ). Consequently, we have a natural periodization map R_(Λ):C(V)→C(Z), given by:

$\begin{matrix} {{{{R_{\Lambda}(f)}(v)} = {\sum\limits_{\lambda \in \Lambda}{f\left( {v + \lambda} \right)}}},} & (1.14) \end{matrix}$

for every ƒ∈C(V) and v∈V. We denote by * the operation of cyclic convolution of functions on Z. Given a pair of functions ƒ, g∈C(Z), their convolution is defined by:

$\begin{matrix} \begin{matrix} {{f*{g(v)}} = {\int_{{v_{1} + v_{2}} = v}{{f\left( v_{1} \right)}{g\left( v_{2} \right)}}}} \\ {{= {\int_{v^{\prime} \in Z}{{f\left( v^{\prime} \right)}{g\left( {v - v^{\prime}} \right)}{v^{\prime}}}}},} \end{matrix} & (1.15) \end{matrix}$

for every v∈V. Note that integration over the torus Z amounts to integration over a fundamental domain of the lattice Λ.

1.4 Finite Tori A finite torus Z₀ is a domain associated with a pair consisting of a lattice Λ⊂V and a sublattice Λ₀⊂Λ. Formally, Z₀ is the finite group defined by the quotient of the lattice Λ by the sublattice Λ₀, that is:

Z ₀=Λ/Λ₀.   (1.16)

In particular, a point z∈Z₀ is a Λ₀-coset in Λ, namely:

z=λ+Λ ₀,   (1.17)

for some λ∈Λ. Geometrically, Z₀ is a finite uniform sampling of the continuous torus Z=V/Λ₀ as we have a natural inclusion:

Λ/Λ₀ ^(o)V/Λ₀.   (1.18)

EXAMPLE 1.4 The Standard Communication Finite Torus

Consider the standard communication lattice Λ_(T,μ). Fix positive integers n, m∈N^(≧1). Let (Λ_(T,μ))_(n,m) be the sublattice defined by:

(Λ_(T,μ))_(n,m) =ZnTμ⊕Zm/T.   (1.19)

The finite torus associated with (Λ_(T,μ))_(n,m)⊂Λ_(T,μ) is given by (see FIG. 26):

$\begin{matrix} \begin{matrix} {Z_{T,\mu}^{m,n} = {\Lambda_{T,\mu}/\left( \Lambda_{T,\mu} \right)_{n,m}}} \\ {{= {{ZT}\; {\mu/{ZnT}}\; \mu \times Z\; {{{1/T}/{Zm}}/T}}};{{Z/{nZ}} \times {Z/{{mZ}.}}}} \end{matrix} & (1.20) \end{matrix}$

Concluding, the finite torus Z_(T,μ) ^(m,n) is isomorphic to the Cartesian product of two cyclic groups; one of order n and the other of order m. We refer to Z_(T,μ) ^(m,n) as the standard communication finite torus.

1.4.1 Functions on finite tori. We denote by C(Z₀) the vector space of complex valued functions on a finite torus Z₀=Λ/Λ₀. A function on Z₀ is naturally equivalent to a function ƒ: Λ→C that is periodic with respect to translations by the sublattice Λ₀, that is:

ƒ(λ+Λ₀)=ƒ(λ)   (1.21)

for every λ∈Λ and λ₀∈Λ₀. Hence, the vector space C(Z₀) coincides with the subspace of Λ₀ periodic functions on Λ, that is, C(Z₀)=C(Λ)_(Λ) ₀ . Consequently, we have a natural periodization map R_(Λ) ₀ : C(Λ)→C(Z₀) given by:

$\begin{matrix} {{{{R_{\Lambda_{0}}(f)}(\lambda)} = {\sum\limits_{\lambda_{0} \in \Lambda_{0}}^{\;}{f\left( {\lambda + \lambda_{0}} \right)}}},} & (1.22) \end{matrix}$

for every ƒ∈C(Λ) and λ∈Λ. We denote by * the operation of finite cyclic convolution of functions on Z₀. Given a pair of functions ƒ, g∈C(Z₀), their convolution is defined by:

$\begin{matrix} \begin{matrix} {{f*{g(\lambda)}} = {\sum\limits_{{\lambda_{1} + \lambda_{2}} = \lambda}^{\;}{{f\left( \lambda_{1} \right)}{g\left( \lambda_{2} \right)}}}} \\ {= {\sum\limits_{\lambda^{\prime} \in Z}^{\;}{{f\left( \lambda^{\prime} \right)}{g\left( {\lambda - \lambda^{\prime}} \right)}}}} \end{matrix} & (1.23) \end{matrix}$

for every v∈V. Note that summation over the finite torus Z₀ amounts to summation over a fundamental domain of the sublattice Λ₀ in the superlattice Λ.

1.4.2 Reciprocity between finite tori. Given a finite torus Z₀=Λ/Λ₀, we denote by Z^(⊥) the finite torus associated with the reciprocal pair Λ^(⊥)⊂Λ₀ ^(⊥), that is:

Z ₀ ^(⊥)=Λ₀ ^(⊥)/Λ^(⊥).   (1.24)

We refer to Z₀ ^(⊥) as the reciprocal finite torus. Although different as sets, one can show that, in fact, Z₀ and Z₀ ^(⊥) are isomorphic as finite groups.

EXAMPLE 1.5

Consider the pair consisting of the standard communication lattice Λ_(T,μ) and the sublattice (Λ_(T,μ))_(m,n)⊂Λ_(T,μ). As shown above, the finite torus associated with (Λ_(T,μ))_(n,m)⊂Λ_(T,μ) is isomorphic to:

Z₀; Z/Zn×Z/Zm.

The reciprocal lattices are given by:

(Λ_(T,μ))^(⊥) =ZT⊕Z1/Tμ,

(Λ_(T,μ))_(m,n) ^(⊥) =ZT/m⊕Z1/nTμ.

Consequently, the reciprocal finite torus is given by:

$\begin{matrix} {Z_{0}^{\bot} = {\left( \Lambda_{T,\mu} \right)_{m,n}^{\bot}/\left( \Lambda_{T,\mu} \right)^{\bot}}} \\ {{= {{{Z\left( {T/m} \right)}/{ZT}} \times {{Z\left( {{1/{nT}}\; \mu} \right)}/{Z\left( {{1/T}\; \mu} \right)}}}};{{Z/{mZ}} \times {Z/{{nZ}.}}}} \end{matrix}$

We see that Z₀ and Z₀ ^(⊥) are isomorphic as finite groups as both groups are isomorphic to the Cartesian product (albeit in different order) of two cyclic groups, one of order n and the other of order m.

2 The Symplectic Fourier Transform

In this section we introduce a variant of the two dimensional Fourier transform, associated with the symplectic form, called the symplectic Fourier transform. Let ψ: R→C^(x) denote the standard complex exponential function:

ψ(z)=e ^(2πiz),   (2.1)

for every z∈R.

2.1 Properties of the Symplectic Fourier Transform

The symplectic Fourier transform is a variant of the two dimensional Fourier transform that is associated with the symplectic form ω. Formally, the symplectic Fourier transform is the linear transformation SF: C(V)→C(V) defined by the rule:

$\begin{matrix} \begin{matrix} {{{{SF}(f)}(u)} = {\int_{v \in V}^{\;}{{\psi \left( {- {\omega \left( {u,v} \right)}} \right)}{f(v)}{v}}}} \\ {{= {\int_{\tau,{v \in R}}^{\;}{{\psi \left( {{tv} - {f\; \tau}} \right)}{f\left( {\tau,v} \right)}{\tau}{v}}}},} \end{matrix} & (2.2) \end{matrix}$

for every ƒ∈C(V) and u=(t,f). We refer to the coordinates (t, f) of the transformed domain as time and frequency, respectively.

In general, the inverse transform of (2.2) is given by the formula:

$\begin{matrix} \begin{matrix} {{{{SF}^{- 1}(f)}(v)} = {\int_{u \in V}^{\;}{{\psi \left( {+ {\omega \left( {u,v} \right)}} \right)}{f(u)}{u}}}} \\ {= {\int_{t,{f \in R}}^{\;}{{\psi \left( {{\tau \; f} - {vt}} \right)}{f\left( {t,f} \right)}{t}{f}}}} \end{matrix} & (2.3) \end{matrix}$

However, since w is anti-symmetric, we have that SF⁻¹=SF. Namely, the symplectic Fourier transform is equal to its inverse.

2.1.1 Interchanging property. The symplectic Fourier transform interchanges between function multiplication and function convolution as formulated in the following proposition.

Proposition 2.1 (Interchanging property). The following conditions hold:

SF(ƒ·g)=SF(ƒ)*SF(g),

SF(ƒ*g)=SF(ƒ)·SF(g),   (2.4)

for every ƒ, g∈C(V).

In fact, the interchanging property follows from a more fundamental property that concerns the operations of two dimensional translation and symplectic modulation.

-   -   Translation: given a vector v₀∈V, define translation by v₀ to be         the linear transformation L_(v) ₀ : C(V)→C(V), given by:

L _(v) ₀ (ƒ)(v)=ƒ(v−v ₀),   (2.5)

for every ƒ∈C(V).

-   -   Modulation: given a vector v₀∈V, define symplectic modulation by         v₀ to be the linear transformation M_(v) ₀ : C(V)→C(V), given         by:

M _(v) ₀ (ƒ)(v)=ψ(ω(v ₀ ,v))ƒ(v),   (2.6)

for every ƒ∈C(V).

Perhaps the most fundamental property of the symplectic Fourier transform is that it interchanges between translation and symplectic modulation. This property is formulated in the following proposition.

Proposition 2.2 (Interchanging translation with symplectic modulation). The following conditions hold:

SF∘L _(v) ₀ =M _(v) ₀ ∘SF,

SF∘M _(v) ₀ =L _(v) ₀ ∘SF,

for every v₀∈V.

2.2 The Discrete Symplectic Fourier Transform

The discrete symplectic Fourier transform relates between functions of two discrete variables and functions of two continuous periodic variables. The formal definition assumes a choice of a lattice Λ⊂V. Let Λ¹⊂V be the reciprocal lattice and let Z^(⊥) denote the torus associated with Λ^(⊥), that is:

Z ^(⊥) =V/Λ ^(⊥).

We refer to Z^(⊥) as the reciprocal torus. The discrete symplectic Fourier transform is the linear transformation SF_(Λ): C(Λ)→C(Z^(⊥)) given by:

$\begin{matrix} {{{{{SF}_{\Lambda}(f)}(u)} = {c \cdot {\sum\limits_{\lambda \in \Lambda}^{\;}{{\psi \left( {- {\omega \left( {u,\lambda} \right)}} \right)}{f(\lambda)}}}}},} & (2.7) \end{matrix}$

for every ƒ∈C(Λ) and u∈V where c is a normalization coefficient taken to be c=vol(Λ). Note, that fixing the value of λ∈Λ, the function ψ(−ω(u,λ))ƒ(λ) is periodic with respect to the reciprocal lattice hence is a function on the reciprocal torus. The inverse transform SF_(Λ) ¹: C(Z^(⊥))→C(Λ) is given by:

$\begin{matrix} {{{{{SF}_{\Lambda}^{- 1}(f)}(\lambda)} = {\int_{u \in Z^{\bot}}^{\;}{{\psi \left( {- {\omega \left( {\lambda,u} \right)}} \right)}{f(u)}{u}}}},} & (2.8) \end{matrix}$

for every ƒ∈C(Λ). Note that taking the integral over the torus Z^(⊥) is equivalent to integrating over a fundamental domain of the lattice Λ^(⊥). 2.2.1 Discrete interchanging property. The discrete symplectic Fourier transform interchanges between function multiplication and function convolution as formulated in the following proposition.

Proposition 2.3 (Discrete interchanging property). The following conditions hold:

$\begin{matrix} {{{{SF}_{\Lambda}\left( {f \cdot g} \right)} = {{{SF}_{\Lambda}(f)}*{{SF}_{\Lambda}(g)}}},} & (2.9) \\ {{{\frac{1}{\sqrt{c}}{{SF}_{\Lambda}\left( {f*g} \right)}} = {\frac{1}{\sqrt{c}}{{{SF}_{\Lambda}(f)} \cdot \frac{1}{\sqrt{c}}}{{SF}_{\Lambda}(g)}}},} & (2.10) \end{matrix}$

for every ƒ, g∈C(Λ) where * stands for periodic convolution.

2.2.2 COMpatibility with the continuous transform. The continuous and discrete symplectic Fourier transforms are compatible. The compatibility relation is formulated in the following Theorem.

Theorem 2.4 (discrete-continuous compatibility relation). We have:

SF _(Λ) ∘R ^(Λ) =R _(Λ) _(⊥) ∘SF,   (2.11)

SF _(Λ) ⁻¹ ∘R _(Λ) _(⊥) =R ^(Λ) ∘SF ⁻¹.   (2.12)

Stated differently, Equation (2.11) provides that taking the continuous Fourier transform of a function ƒ and than periodizing with respect to translations by the reciprocal lattice ΛA¹ is the same as first restricting ƒ to the lattice A and then taking the discrete Fourier transform.

2.3 The Finite Symplectic Fourier Transform

The finite symplectic Fourier transform relates functions of two finite periodic variables. The formal definition assumes a pair consisting of a lattice Λ⊂V and a sublattice Λ₀⊂Λ. We denote by Z₀ the finite torus associated with this pair, that is:

Z ₀=Λ/Λ₀.

Let Λ^(⊥) and Λ₀ ⁻ be the corresponding reciprocal lattices. We denote by Z⁻ the finite torus associated with the reciprocal pair, that is:

Z ₀ ^(⊥)=Λ_(i) ^(⊥)/Λ^(⊥).

The finite symplectic Fourier transform is the linear transformation SF_(Z) ₀ : C(Z₀)→C(Z₀ ^(⊥)) defined by the rule:

SF _(Z) ₀ (ƒ)(μ)=c· _(λ∈Z) ₀ ψ(−ω(μ,λ))ƒ(λ),   (2.13)

for every ƒ∈C(Z₀) and μ∈Λ₀ ^(⊥) where c is a normalization coefficient taken to be c=vol(Λ). The inverse transform SF_(Z) ₀ ⁻¹: C(Z₀ ^(⊥))→C(Z₀) is given by:

$\begin{matrix} {{{{{SF}_{Z_{0}}^{- 1}(f)}(\lambda)} = {{\frac{1}{c_{0}} \cdot {{\,_{\mu \in Z_{0}^{\bot}}\psi}\left( {- {\omega \left( {\lambda,\mu} \right)}} \right)}}{f(\mu)}}},} & (2.14) \end{matrix}$

for every ƒ∈C(Z₀ ^(⊥)) and λ∈Λ where c₀ is a normalization coefficient taken to be c₀=vol(Λ₀).

2.3.1 Finite interchanging property. The finite symplectic Fourier transform interchanges between function multiplication and function cyclic convolution as formulated in the following proposition.

Proposition 2.5 (Discrete interchanging property). The following conditions hold:

$\begin{matrix} {{{\frac{c}{c_{0}}{{SF}_{Z_{0}}\left( {f \cdot g} \right)}} = {\frac{c}{c_{0}}{{SF}_{Z_{0}}(f)}*\frac{c}{c_{0}}{{SF}_{Z_{0}}(g)}}},} & (2.15) \\ {{{\frac{1}{c}{{SF}_{Z_{0}}\left( {f*g} \right)}} = {\frac{1}{c}{{{SF}_{Z_{0}}(f)} \cdot \frac{1}{c}}{{SF}_{Z_{0}}(g)}}},} & (2.16) \end{matrix}$

for every ƒ, g∈C(Z₀) where * stands for finite cyclic convolution.

Note that the normalization coefficient c/c₀ in equation (2.15) is equal the number of points in the finite torus Z₀.

2.3.2 Compatibility with the discrete transform. The discrete and finite symplectic Fourier transforms are compatible. The compatibility relation is formulated in the following Theorem.

Theorem 2.6. We have:

SF _(Z) ₀ ∘R _(Λ) ₀ =R ^(Λ) ⁰ ^(⊥) ∘SF _(Λ,)   (2.17)

SF _(Z) ₀ ∘R ^(Λ) ⁰ ^(⊥) =R _(A) ₀ ∘SF _(Λ) ¹   (2.18)

In plain language, Equation (2.17) states that taking the discrete symplectic Fourier transform of a function ƒ on a lattice Λ and than restricting to the reciprocal lattice Λ₀ ^(⊥) is the same as first periodizing ƒ with respect to translations by the sublattice Λ₀ and than taking the finite Fourier transform.

EXAMPLE 2.7

Consider the standard communication lattice Λ_(T,μ), and the sublattice (Λ_(T,μ))_(n,m). We have the following isomorphisms:

Z₀; Z/nZ×Z/mZ,

Z₀ ^(⊥); Z/mZ×Z/nZ.

In terms of these realizations the finite symplectic Fourier transform and its inverse take the following concrete forms:

$\begin{matrix} {{{{{SF}_{Z_{0}}(f)}\left( {k,l} \right)} = {\mu_{K = 0_{L = 0}}^{n - 1^{m - 1}}{\psi \left( {{kL} - {lK}} \right)}{f\left( {K,L} \right)}}},} & (2.19) \\ {{{{{SF}_{Z_{0}}^{- 1}(f)}\left( {K,L} \right)} = {\frac{1}{{mn}\; \mu}{{\,_{k = 0_{l = 0}}^{m - 1^{n - 1}}\psi}\left( {{Kl} - {Lk}} \right)}{f\left( {k,l} \right)}}},} & (2.20) \end{matrix}$

where in the first equation k∈[0, m−1], l∈[0,n−1] and in the second equation K∈[0,n−1], L−[0,m−1]. Note the minus sign in the Fourier exponent due to the symplectic pairing.

3 Heisenberg Theory

Let H denote the Hilbert space of square integrable complex functions on the real line R. We denote the parameter of the line by t and refer to it as time. The inner product on H is given by the standard formula:

ƒ,g

= _(x∈R) ƒ(x) g(x)dx,   (3.1)

We refer to H as the signal space and to functions in the signal space as waveforms. Heisenberg theory concerns the mathematical structures underlying the intricate interaction between the time and frequency dimensions. In a nutshell, the theory study the algebraic relations between two basic operations on functions: time delay and Doppler shift.

3.1 Time Delay and Doppler Shift

The operations of time delay and Doppler shift establish two one parametric families of Unitary transformations on H.

3.1.1 Time delay. Given a real parameter τ∈R the operation of time delay by τ is a linear transformation L_(τ): H→H given by

L _(τ)(ƒ)(t)=ƒ(t−τ),   (3.2)

for every ƒ∈H and t∈R. One can show that L_(τ) is a Unitary transformation, namely it preserves the inner product:

L_(τ)ƒ,L_(τ)g

=

ƒ, g

for every ƒ, g∈H. More over, the family of transformation {L_(τ): τ∈R} satisfies:

L _(τ) ₁ _(+τ) ₂ =L _(τ) ₁ ∘L _(τ) ₂ ,

for every τ₁, τ₂ ∈R. In particular, the operations of time delay commute with one another, that is, L_(τ) ₁ ∘L_(τ) ₂ =L_(τ) ₁ ∘L_(τ) ₂ .

3.1.2 Doppler shift. Given a real parameter v∈R the operation of Doppler shift by v is a linear transformation M_(v): H→H given by

M _(c)(ƒ)(t)=ψ(vt)ƒ(t),   (3.3)

for every ƒ∈H and t∈R. Recall that ψ stands for the standard complex exponential function ψ(z)=e^(2πiz). One can show that M_(v) is a Unitary transformation, namely it preserves the inner product:

M_(v)ƒ,M_(v)g

=

ƒ,g

for every ƒ, g∈H. More over, the family of transformation {M_(v): v∈R} satisfies:

M _(v) ₁ _(−v) ₂ =M _(v) ₁ ∘M _(v) ₂ ,

for every v₁, v₂∈R. In particular, the operations of time delay commute with one another, that is, M_(v) ₁ ∘M_(v) ₂ =M_(v) ₂ ∘M_(v) ₁ .

3.2 The Heisenberg Representation

The Heisenberg representation is a mathematical structure unifying the two operations of time delay and Doppler shift. The main difficulty is that these operations do not commute with one another, instead they satisfy the following condition:

L _(τ) M _(v)=ψ(−τv)M _(v) L _(τ),   (3.4)

The starting point is to consider the unified delay-Doppler linear transformation:

π(τ,v)=L _(τ) M _(v),   (3.5)

for every pair of real parameters τ, v∈R. In this representation, the ordered pair (τ,v) is considered as a point in the delay Doppler plane V. One can show that π(τ, v) is a Unitary transformation as composition of such. The two dimensional family of transformations {π(v): v∈V} defines a linear transformation Π: C(V)→Hom(H,H), given by:

Π(ƒ)=∫_(v∈V)ƒ(v)π(v)dv,   (3.6)

for every ƒ∈C(V), where the range of Π is the vector space of linear transformations from H to itself which we denote by Hom(H,H). In words, the map Π takes a function on the delay Doppler plane and send it to the linear transformation given by weighted superposition of delay-Doppler transformations where the weights are specified by the values of the function. The map Π is called the Heisenberg representation. A fundamental fact which we will not prove is that the map Π is essentially an isomorphism of vector spaces. Hence it admits an inverse Π⁻¹: Hom(H, H)→C(V) called the Wigner transform. The Wigner transform is given by:

Π⁻¹(A)(v)=Tr(π(v)^(H) A.   (3.7)

for every A∈Hom(H,H) and v∈V. The Heisenberg representation and the Wigner transform should be thought of as a “change of coordinates” converting between functions on the delay Doppler plane and linear transformations on the signal space (which may be represented using matrices). To summarize, a linear transformation A∈Hom(H,H) admits a unique expansion as a superposition of delay-Doppler transformations. The coefficients in this expansion are given by the function a=Π⁻¹(A). The function a is refereed to as the delay-Doppler impulse response of the transformation A. The Heisenberg formalism generalizes the classical framework of time invarinat linear systems to time varying linear systems. Note that in the former, a time invariant linear transformation admits a unique expansion as a superposition of time delays and the coefficients in the expansion constitute the classical impulse response.

3.2.1 Ambiguity function. The formula of the Wigner transform of a general linear transformation, Equation (3.7), is quite abstract. Fortunately, for specific type of linear transformations the Wigner transform takes a more explicit form. Say we are given a waveform g∈H, of unit norm ∥g∥=1. Let P_(g) denote the orthogonal projection on the one dimensional subspace spanned by g, given by:

P _(g)(φ)=g

g,φ

,   (3.8)

for every φ∈H.

Proposition. The Wigner transform of P_(g) admits the following formula:

Π⁻¹(P _(g))(v)=

π(v)g,g

,   (3.9)

for every v∈V.

Denote A_(g)=Π⁻¹(P_(g)) and refer to this function as the ambiguity function of g. We have:

Π(A _(g))=P _(g).   (3.10)

The above equation means that A_(g) is the coefficients in the delay-Doppler expansion of the operator P_(g)—this is the Heisenberg interpretation of the ambiguity function.

3.2.2 Cross ambiguity function. The cross ambiguity function is a generalization of the ambiguity function to the case of two waveforms g₁,g₂ ∈H where g₁ is assumed to be of unit norm. Let P_(g) ₁ _(,g) ₂ denote the following rank one linear transformation on H:

P _(g) ₁ _(,g) ₂ (φ)=g ₂

g ₁,φ

,   (3.11)

for every φ∈H.

Proposition. The Wigner transform of P_(g) ₁ _(,g) ₂ admits the following formula:

Π⁻¹(P _(g) ₁ _(,g) ₂ )(v)=

π(v)g ₁ ,g ₂

,   (3.12)

for every v∈V.

Denote A_(g) ₁ _(,g) ₂ =Π⁻¹(P_(g) ₁ _(,g) ₂ ) and refer to this function as the cross ambiguity function of g₁ and g₂. We have:

Π(A _(g) ₁ _(,g) ₂ )=P _(g) ₁ _(,g) ₂ .   (3.13)

Hence, according to the Heisenberg interpretation, the cross-ambiguity function is the coefficients in the delay-Doppler expansion of the operator P_(g) ₁ _(,g) ₂ .

3.3 Heisenberg Interchanging Property

The main property of the Heisenberg representation is that it interchanges between the operation of composition of linear transformations on H and a twisted version of the convolution operation of functions on V. In order to define the operation of twisted convolution we consider the form β: V×V→V, given by:

β(v,v′)=vτ′,   (3.14)

where v=(τ, v) and v′=(τ′,v′). The form β satisfies the “polarization” condition:

β(v, v′)−β(v′, v)=ω(v, v′),   (3.15)

for every v, v′∈V. Given a pair of functions ƒ, g∈C(V) their twisted convolution is defined by the following rule:

$\begin{matrix} \begin{matrix} {{f*_{t}{g(v)}} = {\int_{{{v\; 1} + {v\; 2}} = v}^{\;}{{\psi \left( {\beta \left( {v_{1},v_{2}} \right)} \right)}{f\left( v_{1} \right)}{g\left( v_{2} \right)}}}} \\ {= {\int_{v^{\prime} \in V}^{\;}{{\psi \left( {\beta \left( {v^{\prime},{v - v^{\prime}}} \right)} \right)}{f(v)}{g\left( {v - v^{\prime}} \right)}{v^{\prime}}}}} \end{matrix} & (3.16) \end{matrix}$

One can see that the twisted convolution operation differs from the usual convolution operation, Equation (1.2), by the multiplicative factor ψ(β(v₁, v₂)). As a consequence of this factor, twisted convolution is a non-commutative operation in contrast with conventional convolution. This non-commutativity is intrinsic to the fabric of time and frequency. The Heisenberg interchanging property is formulated in the following Theorem.

Theorem 3.1 (Heisenberg Interchanging property). We have:

Π(ƒ*_(t) g)=Π(ƒ)∘Π(g),   (3.17)

for every ƒ, g∈C(V).

The following example is key to understanding the motivaiton behind the constructions presented in this section. In a nutshell, it explains why the twist in Formula (3.16) accounts for the phase in the commutation relation between the time delay and Doppler shift operations, see Equation (3.4).

EXAMPLE 3.2

We verify Equation (3.17) in a concrete case. Let v=(τ,v) and v′=(τ′,v′). Consider the delta functions δ_(v) and δ_(v′). On the one hand, we have:

Π(δ_(v))=L _(τ) M _(v),

Π(δ_(v′))=L _(τ′) M _(v′),

and consequently:

$\begin{matrix} \begin{matrix} {{{\Pi \left( \delta_{v} \right)} \circ {\Pi \left( \delta_{v^{\prime}} \right)}} = {L_{\tau}M_{v}L_{\tau^{\prime}}M_{v^{\prime}}}} \\ {= {{\psi \left( {v\; \tau^{\prime}} \right)}L_{\tau}L_{\tau^{\prime}}M_{v}M_{v^{\prime}}}} \\ {= {{\psi \left( {v\; \tau^{\prime}} \right)}L_{\tau + \tau^{\prime}}M_{v + v^{\prime}}}} \\ {= {{\psi \left( {v\; \tau^{\prime}} \right)}{\pi \left( {v + v^{\prime}} \right)}}} \\ {= {\Pi \left( {{\psi \left( {v\; \tau^{\prime}} \right)}\delta_{v + v^{\prime}}} \right)}} \end{matrix} & (3.18) \end{matrix}$

On the other hand:

$\begin{matrix} \begin{matrix} {{\delta_{v}*_{t}\delta_{v^{\prime}}} = {{\psi \left( {\beta \left( {v,v^{\prime}} \right)} \right)}\delta_{v}*\delta_{v^{\prime}}}} \\ {= {{\psi \left( {v\; \tau^{\prime}} \right)}{\delta_{v + v^{\prime}}.}}} \end{matrix} & (3.19) \end{matrix}$

Consequently:

Π(δ_(v)*_(t)δ_(v′))=ψ(vτ′)π(v+v′)   (3.20)

Hence we verified that: Π(δ_(v)*_(t)δ_(v′))=Π(δ_(v))∘Π(δ_(v′)).

3.4 Fundamental Channel Equation

We conclude this section with formulating a fundamental equation relating the following structures:

-   -   1. Cross ambiguity function.     -   2. Ambiguity function     -   3. Channel transformation.     -   4. Twisted convolution.

This fundamental equation is pivotal to the two dimensional channel model that will be discussed in the next section. Let g∈H be a waveform of unit norm. Let h∈C(V). We denote by H the channel transformation:

H=Π(h).   (3.21)

Theorem 3.3 (Fundamental channel equation). The following equation holds:

A _(g,H(g)) =h* _(t) A _(g).   (3.22)

In words, the fundamental equation, (3.22), asserts that the cross ambiguity function of g with H(g) is the twisted convolution of h with the ambiguity function of g.

4. The Continuous OTFS Transceiver

In this section we describe a continuous variant of the OTFS transceiver.

4.1 Set-Up

The definition of the continuous OTFS transceiver assumes the following data:

-   -   1. Communication lattice. An undersampled lattice:

Λ⊂V,

where vol(Λ)=μ, for some μ≧1.

-   -   2. Generator waveform. A waveform of unit norm:

g∈H,

satisfying the orthogonality condition A_(g)(λ)=0 for every non-zero element λ∈Λ^(x).

-   -   3. 2D filter. A window function:

W∈C(Λ).

We note that, typically, the support of the 2D filter along the delay and Doppler dimensions is bounded by the latency and bandwidth restrictions of the communication packet respectively.

EXAMPLE 4.1

A typical example of a communication lattice is the standard communication lattice:

Λ_(T,μ) =ZμT⊕Z1/T.

A typical example of a 2D filter is:

${W\left\lbrack {{{KT}\; \mu},{L\text{/}T}} \right\rbrack} = \left\{ {\begin{matrix} 1 & {{K \in \left\lbrack {0,{n - 1}} \right\rbrack},{L \in \left\lbrack {0,{m - 1}} \right\rbrack}} \\ 0 & {otherwise} \end{matrix},} \right.$

where m,n∈N^(≧1) and T∈R. The parameter T is called the symbol time. The real numbers nμT and m/T are the latency and bandwidth of the communication packet respectively. Note that a more sophisticated design of a spectral window will involve some level of tapering around the boundaries in the expense of spectral efficiency. Finally, in case μ=1 (critical sampling) a simple example of an orthogonal waveform is:

g=1_([0,T]).

4.1.1 Generalized set-up. The set-up can be slightly generalized by assuming, instead of a single orthogonal waveform g, a pair consisting of transmit waveform g_(t)∈H and receive waveform g_(τ)∈H satisfying the following cross orthogonality condition:

A _(g) _(r) _(,g) _(t) (λ)=0,   (4.1)

for every λ∈Λ^(x). The trade-off in using a pair where g_(r)≠g_(t) is gaining more freedom in the design of the shape of each waveform in expense of lower effective SNR at the receiver. For the sake of simplicity, in what follows we will consider only the case when g_(r)=g_(t) with the understanding that all results can be easily extended to the more general case.

4.2 Continuous OTFS Modulation Map. Let Z^(⊥) denote the torus associated with the lattice Λ^(⊥) reciprocal to the communication lattice. The continuous OTFS modulation map is the linear transformation M: C(Z^(⊥))→H, given by:

M(x)=Π(W·SF _(Λ) ⁻¹(x))g,   (4.2)

for every x∈C(Z⁻). Roughly, the continuous OTFS modulation is the composition of the Heisenberg representation with the (inverse) discrete symplectic Fourier transform. In this regard it combines the two intrinsic structures of the delay Doppler plane. Formula (4.2) can be written more explicitly as:

$\begin{matrix} {{{M(x)} = {\sum\limits_{\lambda \in \Lambda}{{W(\lambda)}{X(\lambda)}{\pi (\lambda)}g}}},} & (4.3) \end{matrix}$

where X=SF_(Λ) ⁻¹(x).

FIG. 27 illustrates an exemplary structure of the OTFS modulation map. Note that FIG. 27 includes an additional spreading transformation given by convolution with a specifically designed function α∈C(Z^(⊥)). The effect of this convolution is to spread the energy of each informaiton symbol uniformaly along the torus Z^(⊥) achieving a balanced power profile of the transmit waveform depending only on the total energy of the information vector x.

4.3 Continuous OTFS Demodulation Map

The continuous OTFS demodulation map is the linear transformation D: H→C(Z^(⊥)), given by:

D(φ)=SF _(Λ)( W·R ^(Λ)(A _(g,100) )),   (4.4)

for every φ∈H. Roughly, the continuous OTFS demodulation map is the composition of the discrete symplectic Fourier transform with the Wigner transform. Formula (4.4) can be written more explicitely as:

$\begin{matrix} {{{{D(\phi)}(u)} = {c \cdot {\sum\limits_{\lambda \in \Lambda}{{\psi \left( {- {\omega \left( {u,\lambda} \right)}} \right)}{\overset{\_}{W}(\lambda)}{\langle{{{\pi (\lambda)}g},\phi}\rangle}}}}},} & (4.5) \end{matrix}$

for every φ∈H and u∈Z^(⊥).

4.4 Two Dimensional Channel Model

Before describing the technical details of the two-dimensional channel model for the OTFS transceiver, we will provide an overview in simplified terms. Consider first that in the standard one-dimensional physical coordinates of time (or frequency), the wireless channel is a combination of multipath moving reflectors that induce a distortion on the transmitted signal. This distortion arises due to superposition of time delay and Doppler shifts. Such a general distortion appears in standard physical coordinates as a fading non-stationary inter-symbol interference pattern. In contrast, when converted to the coordinates of the OTFS modulation torus, the distortion becomes a static two dimensional local ISI distortion. This is a novel and characteristic attribute of the OTFS transceiver. In what follows we provide a rigorous derivation of this characteristic. To this end, we begin by considering the simplest multipath channel H: H→H that is already a combination of time delay and Doppler shift. In our terminology, this channel is given by:

H=Π*δ _(v) ₀ )=L _(r) ₀ M _(v) ₀ ,   (4.6)

for some v₀=(τ₀,v₀)∈V. We assume, in addition, that the vector v₀ satisfy ∥v₀∥=diam(Λ) where the diameter of the lattice is by definition the radius of its Voronoi region. Stated differently, we assume that the vector is small compared with the dimensions of the lattice. Note, that this assumption holds for most relevant scenarios in wireless applications. We proceed to derive the structure of the modulation equivalent channel. Let q: V→C be the quadratic exponential function given by:

q(v)=ψ(−β(v,v)),   (4.7)

for every v∈V.

Proposition 4.2 The modulation equivalent channel y=D∘H∘M(x) is a periodic convolution y=h_(eqv)*x, where the impulse response h_(eqv)∈C(Z^(⊥)) is given by:

h _(eqv) =R _(Λ) _(⊥) (q(v ₀)δ_(v) ₀ )*SF _(Λ) |W| ²,   (4.8)

That is, Equation (4.8) states that the modulation equivalent channel is a periodic convolution with a periodic blurred version of q(v₀)δ_(v) ₀ where the blurring pulse is given by the symplectic Fourier transform of the discrete pulse |W|². This blurring results in a resolution loss which is due to the spectral truncation imposed by the filter W. As a result, the resolution improves as the window size increases (what amounts to longer latency and wider bandwidth). Granting the validity of Equation (4.8), it is straightforward to deduce the modulation equivalent of a general wireless channel:

H=Π(h),   (4.9)

for any function h∈C(V) where we assume that the support of h is much smaller than the diameter of the lattice Λ. The general two dimensional channel model is formulated in the following theorem.

Theorem (Two dimensional channel model). The modulation equivalent channel y=D∘H∘M(x) is a periodic convolution y=h_(eqv)*x with the impulse response h_(eqv)∈C(Z^(⊥)), given by:

h _(eqv) =R _(Λ) _(⊥) (q·h)*SF _(Λ) |W| ².   (4.10)

Stated differently, the modulation equivalent channel is a periodic convolution with a periodic blurred version of q·h where the blurring pulse is given by the discrete symplectic Fourier transform of the discrete pulse |W|².

4.4.1 Derivation of the two dimensional channel model. We proceed to derive Equation (4.8). Let x∈C(Z^(⊥)). Let φ_(t)∈H denote the transmitted signal. We have:

$\begin{matrix} \begin{matrix} {\phi_{t} = {M(x)}} \\ {{= {{\Pi \left( {W \cdot X} \right)}g}},} \end{matrix} & (4.11) \end{matrix}$

where X=SF_(Λ) ⁻¹(x). Let φ_(r)∈H denote the received signal. We have:

$\begin{matrix} \begin{matrix} {\phi_{r} = {H\left( \phi_{t} \right)}} \\ {= {{{\Pi \left( \delta_{v_{0}} \right)} \circ {\Pi \left( {W \cdot X} \right)}}g}} \\ {{= {{\Pi \left( {\delta_{v_{0}}*_{t}\left( {W \cdot X} \right)} \right)}g}},} \end{matrix} & (4.12) \end{matrix}$

where the third equality follows from the Heisenberg property of the map Π (Theorem 3.1). The demodulated vector y=D(φ_(r)) is given by:

D(φ_(r))=SF _(Λ)( W·R ^(Λ)(A _(g,φ) _(r) )).   (4.13)

We now evaluate the right hand side of (4.13) term by term. Applying the fundamental channel equation (Theorem 3.3) we get:

A _(g,φ) _(r) =δ_(v) ₀ *_(t)(W·X)*_(t) A _(g).   (4.14)

Considering the restriction R^(Λ)(A_(g,φ) _(r) ) we have the following proposition.

Proposition. We have

R^(Λ)(A_(g,φ) _(r) ),q(v₀)R^(Λ)(ψ_(v) ₀ )·(WX),   (4.15)

where ψ_(v) ₀ (v)=ψ(ω(v₀,v)) for every v∈V.

Combining Equations (4.13) and (4.15) we get:

D(φ_(r)); q(v ₀)SF _(Λ)(└R ^(Λ)(ψ_(v) ₀ )|W| ² ┘·X)=└R _(A) _(⊥) (q(v ₀)δ_(v) ₀ )*SF _(Λ)(|W| ²)┘*x.   (4.16)

This concludes the derivation of the two dimensional channel model.

4.5 Explicit Interpretation

We conclude this section by interpreting the continuous OTFS modulation map in terms of classical DSP operations. We use in the calculations the standard communication lattice Λ=Λ_(T,μ) from Example 1.1. Recall the definition of the continuous modulation map:

$\begin{matrix} {{{M(x)} = {\sum\limits_{\lambda \in \Lambda}{{W(\lambda)}{X(\lambda)}{\pi (\lambda)}g}}},} & (4.17) \end{matrix}$

for every x∈C(Z^(⊥)), where X=SF_(Λ) ¹(x). Formula (4.17) can be written more explicitely as:

$\begin{matrix} {\begin{matrix} {{M(x)} = {\sum\limits_{K,L}{{W\left\lbrack {{K\; \mu \; T},{L/T}} \right\rbrack}{X\left\lbrack {{K\; \mu \; T},{L/T}} \right\rbrack}L_{{KT}\; \mu}{M_{L/T}(g)}}}} \\ {{\sum\limits_{K}{L_{{KT}\; \mu}{\sum\limits_{L}{{W_{K}\left\lbrack {L/T} \right\rbrack}{X_{K}\left\lbrack {L/T} \right\rbrack}{M_{L/T}(g)}}}}}} \\ {= {\sum\limits_{K}{{L_{{KT}\; \mu}\left( \varphi_{K} \right)}.}}} \end{matrix}{{where}\text{:}}} & (4.18) \\ {\varphi_{K} = {\sum\limits_{L}{{W_{K}\left\lbrack {L\text{/}T} \right\rbrack}{X_{K}\left\lbrack {L\text{/}T} \right\rbrack}{{M_{L/T}(g)}.}}}} & (4.19) \end{matrix}$

The waveform φ_(K) is called the Kth modulation block.

4.5.1 Frequency domain interpretation. Let G denote the Fourier transform of g. Equation (4.19) can be interpreted as feeding the weighted sequence W_(K)X_(K) into a uniform filterbank with each subcarrier shaped by the filter G. See FIG. 28.

4.5.2 Time domain interpretation. Let w_(K) and x_(K) denote the inverse discrete Fourier transform of the discrete waveforms W_(K) and X_(K) respectively. Both waveforms are periodic with period T. We have:

φ_(K)∝(w_(K)*x_(K))·g,

where * stands for periodic convolution. The waveform x_(K) can be expressed in terms of the information vector x as follows:

x_(K)(t) ∝ ∫_(v)ψ(KT μ v)x(t, v)v,

In words, x_(K)(t) is proportional to the Kth component of the inverse discrete Fourier transform of x along the Doppler dimension.

5 The Finite OTFS Transceiver

In this section we describe a finite variant of the OTFS transceiver. This variant is obtained, via uniform sampling, from the continuous variant described previously.

5.1 Set-Up

The definition of the finite OTFS transceiver assumes the following:

-   -   1. Communication lattice. An undersampled lattice:

Λ⊂V,

where vol(Λ)=μ, for some μ≧1.

-   -   2. Communication sublattice. A sublattice:

Λ₀⊂Λ

-   -   3. Generator waveform. A waveform of unit norm:

g∈H,

satisfying the orthogonality condition A_(g)(λ)=0 for every λ∈Λ^(x).

-   -   4. 2D filter. A window function:

W∈C(Λ).

Note that the support of the 2D filter is typically compatible with the configuration of the sublattice, as demonstrated in the following example.

EXAMPLE 5.1

The standard nested pair of communication lattice and sublattice is:

Λ=Λ_(T,μ) =ZμT⊕Z1/T,

Λ₀=(Λ_(T,μ))_(n,m) =ZnμT⊕Zm/T,

where m, n∈N^(≧1) and T∈R is a parameter called the symbol time. The real numbers nμT and m/T are the latency and bandwidth of the communication packet respectively. A typical compatible 2D filter is:

${W\left\lbrack {{{KT}\; \mu},{L\text{/}T}} \right\rbrack} = \left\{ {\begin{matrix} 1 & {{K \in \left\lbrack {0,{n - 1}} \right\rbrack},{L \in \left\lbrack {0,{m - 1}} \right\rbrack}} \\ 0 & {otherwise} \end{matrix},} \right.$

More sophisticated designs of a spectral window may involve, for example, some level of tapering around the boundaries at the expense of spectral efficiency. Finally, in case μ=1, a simple example of orthogonal waveform is:

g=1_([0,T]).

5.2 Finite OTFS Modulation Map

Let Λ⁻⊂Λ₀ ^(⊥) be the reciprocal nested pair. Let Z₀ ^(⊥)∈Z^(⊥) be the finite reciprocal torus. The finite OTFS modulation map is the linear transformation M_(f): C(Z₀ ^(⊥))→H, defined by:

M _(f)(x)=Π(W·SF _(Z) ₀ ⁻¹(x))g,   (5.1)

for every information vector x∈C(Z₀ ¹). Formula (5.1) can be written more explicitely as:

${{M_{t}(x)} = {\sum\limits_{\lambda \in \Lambda}{{W(\lambda)}{X(\lambda)}{\pi (\lambda)}g}}},$

where X=SF_(Z) ₀ ⁻¹(x).

5.3 Finite OTFS Demodulation Map

The finite OTFS demodulation map is the linear transformation D_(f): H→C(Z₀ ^(⊥)), given by:

D _(f)(φ)=SF _(Z) ₀ (R _(A) ₀ ( W·R ^(Λ) A _(g,φ))),   (5.2)

for every φ∈H. Formula (5.2) can be written more explicitely as:

${{{D_{f}(\phi)}(u)} = {c \cdot {\sum\limits_{\lambda \in Z_{0}}{{\psi \left( {- {\omega \left( {u,\lambda} \right)}} \right)}{\overset{\_}{W}(\lambda)}{\langle{{{\pi (\lambda)}g},\phi}\rangle}}}}},$

for every φ∈H and λ∈Λ₀ ^(⊥). Recall that the normalization coefficient c=vol(Λ).

5.4 The Finite Two Dimensional Channel Model

Let H=Π(h) be the channel transformation where h∈C(V) is assumed to have small support compared with the dimensions of the communication lattice. Recall the quadratic exponential:

q(v)=ψ(−β(v, v)).

Theorem 5.2 (Finite 2D channel model). The finite modulation equivalent channel y=D_(f)∘H∘M_(f)(x) is a cyclic convolution y=h_(eqv,f)*x with the impulse response h_(eqv,f)∈C(Z₀ ^(⊥)), given by:

h _(eqv,f) =R ^(Λ) ⁰ ^(⊥) (R _(Λ) _(⊥) (q·h)*SF _(Λ) |W| ²)   (5.3)

FIG. 18 demonstrates the statement of this theorem. The bar diagram 1810 represents the transmitted information vector x. The bar diagram 1820 represents the received information vector y. The bar diagram 1830 represents the 2D impulse response realizing the finite modulation equivalent channel. The received vector is related to the transmit vector by 2D cyclic convolution with the 2D impulse response. Finally, we see from Equation (5.3) that the finite impulse response h_(eqv,f) is the sampling of the continuous impulse response h_(eqv) on the finite subtorus Z₀ ⁻⊂Z⁻.

5.5 Explicit Interpretation

We conclude this section by interpreting the finite OTFS modulation map in terms of classical DSP operations. We use in the calculations the nested pair Λ₀⊂Λ from example 5.1. Recall the definition of the finite modulation map:

$\begin{matrix} {{{M_{f}(x)} = {\sum\limits_{\lambda \in \Lambda}{{W(\lambda)}{X(\lambda)}{\pi (\lambda)}g}}},} & (5.4) \end{matrix}$

for every x∈C(Z₀ ^(⊥)), where X=SF_(Z) ₀ ⁻¹(x). Formula (5.4) can be written more explicitely as:

$\begin{matrix} {\begin{matrix} {{M_{t}(x)} = {\sum\limits_{K,L}{{W\left\lbrack {{K\; \mu \; T},{L\text{/}T}} \right\rbrack}{X\left\lbrack {{K\; \mu \; T},{L\text{/}T}} \right\rbrack}L_{{KT}\; \mu}{M_{L/T}(g)}}}} \\ {{\sum\limits_{K}{L_{{KT}\; \mu}{\sum\limits_{L}{{W_{K}\left\lbrack {L\text{/}T} \right\rbrack}{X_{K}\left\lbrack {L\text{/}T} \right\rbrack}{M_{L/T}(g)}}}}}} \\ {= {\sum\limits_{K}{{L_{{KT}\; \mu}\left( \varphi_{K} \right)}.}}} \end{matrix}{{where}\text{:}}} & (5.5) \\ {\varphi_{K} = {\sum\limits_{L}{{W_{K}\left\lbrack {L\text{/}T} \right\rbrack}{X_{K}\left\lbrack {L\text{/}T} \right\rbrack}{M_{L/T}(g)}}}} & (5.6) \end{matrix}$

The waveform φ_(K) is called the Kth modulation block.

5.5.1 Frequency domain interpretation. Let G denote the Fourier transform of g. Equation (5.6) can be interpreted as feeding the sequence W_(K)X_(K) into a uniform filterbank with each subcarrier shaped by the filter G.

5.5.2 Time domain interpretation. Let w_(K) and x_(K) denote the inverse discrete Fourier transform of the discrete waveforms W_(K) and X_(K) respectively. Both waveforms are periodic with period T. We have:

${\varphi_{K} \propto {\left( {w_{K}*{\sum\limits_{k}{{x_{K}\left\lbrack {{kT}\text{/}\; m} \right\rbrack}\delta_{{kT}/m}}}} \right) \cdot g}},$

where * stands for periodic convolution. The waveform x_(K) can be expressed in terms of the information vector x as:

${{x_{K}\left( {{kT}\text{/}m} \right)} \propto {\sum\limits_{l = 0}^{n - 1}{{\psi ({Kl})} \times \left\lbrack {\frac{kT}{m},\frac{l}{{nT}\; \mu}} \right\rbrack}}},$

In words, x_(K) is proportional to the inverse finite Fourier transform of x along the Doppler dimension.

While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. They are not intended to be exhaustive or to limit the claims to the precise forms disclosed. Indeed, many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the described systems and methods and their practical applications, they thereby enable others skilled in the art to best utilize the described systems and methods and various embodiments with various modifications as are suited to the particular use contemplated.

Where methods described above indicate certain events occurring in certain order, the ordering of certain events may be modified. Additionally, certain of the events may be performed concurrently in a parallel process when possible, as well as performed sequentially as described above. Although various modules in the different devices are shown to be located in the processors of the device, they can also be located /stored in the memory of the device (e.g., software modules) and can be accessed and executed by the processors. Accordingly, the specification is intended to embrace all such modifications and variations of the disclosed embodiments that fall within the spirit and scope of the appended claims.

The foregoing description, for purposes of explanation, used specific nomenclature to provide a thorough understanding of the claimed systems and methods. However, it will be apparent to one skilled in the art that specific details are not required in order to practice the systems and methods described herein. Thus, the foregoing descriptions of specific embodiments of the described systems and methods are presented for purposes of illustration and description. They are not intended to be exhaustive or to limit the claims to the precise forms disclosed; obviously, many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the described systems and methods and their practical applications, they thereby enable others skilled in the art to best utilize the described systems and methods and various embodiments with various modifications as are suited to the particular use contemplated. It is intended that the following claims and their equivalents define the scope of the systems and methods described herein.

The various methods or processes outlined herein may be coded as software that is executable on one or more processors that employ any one of a variety of operating systems or platforms. Additionally, such software may be written using any of a number of suitable programming languages and/or programming or scripting tools, and also may be compiled as executable machine language code or intermediate code that is executed on a framework or virtual machine.

Examples of computer code include, but are not limited to, micro-code or micro-instructions, machine instructions, such as produced by a compiler, code used to produce a web service, and files containing higher-level instructions that are executed by a computer using an interpreter. For example, embodiments may be implemented using imperative programming languages (e.g., C, Fortran, etc.), functional programming languages (Haskell, Erlang, etc.), logical programming languages (e.g., Prolog), object-oriented programming languages (e.g., Java, C++, etc.) or other suitable programming languages and/or development tools. Additional examples of computer code include, but are not limited to, control signals, encrypted code, and compressed code.

In this respect, various inventive concepts may be embodied as a computer readable storage medium (or multiple computer readable storage media) (e.g., a computer memory, one or more floppy discs, compact discs, optical discs, magnetic tapes, flash memories, circuit configurations in Field Programmable Gate Arrays or other semiconductor devices, or other non-transitory medium or tangible computer storage medium) encoded with one or more programs that, when executed on one or more computers or other processors, perform methods that implement the various embodiments of the invention discussed above. The computer readable medium or media can be transportable, such that the program or programs stored thereon can be loaded into one or more different computers or other processors to implement various aspects of the present invention as discussed above.

The terms “program” or “software” are used herein in a generic sense to refer to any type of computer code or set of computer-executable instructions that can be employed to program a computer or other processor to implement various aspects of embodiments as discussed above. Additionally, it should be appreciated that according to one aspect, one or more computer programs that when executed perform methods of the present invention need not reside on a single computer or processor, but may be distributed in a modular fashion amongst a number of different computers or processors to implement various aspects of the present invention.

Computer-executable instructions may be in many forms, such as program modules, executed by one or more computers or other devices. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Typically the functionality of the program modules may be combined or distributed as desired in various embodiments.

Also, data structures may be stored in computer-readable media in any suitable form. For simplicity of illustration, data structures may be shown to have fields that are related through location in the data structure. Such relationships may likewise be achieved by assigning storage for the fields with locations in a computer-readable medium that convey relationship between the fields. However, any suitable mechanism may be used to establish a relationship between information in fields of a data structure, including through the use of pointers, tags or other mechanisms that establish relationship between data elements.

Also, various inventive concepts may be embodied as one or more methods, of which an example has been provided. The acts performed as part of the method may be ordered in any suitable way. Accordingly, embodiments may be constructed in which acts are performed in an order different than illustrated, which may include performing some acts simultaneously, even though shown as sequential acts in illustrative embodiments.

All definitions, as defined and used herein, should be understood to control over dictionary definitions, definitions in documents incorporated by reference, and/or ordinary meanings of the defined terms.

The indefinite articles “a” and “an,” as used herein in the specification and in the claims, unless clearly indicated to the contrary, should be understood to mean “at least one.”

The phrase “and/or,” as used herein in the specification and in the claims, should be understood to mean “either or both” of the elements so conjoined, i.e., elements that are conjunctively present in some cases and disjunctively present in other cases. Multiple elements listed with “and/or” should be construed in the same fashion, i.e., “one or more” of the elements so conjoined. Other elements may optionally be present other than the elements specifically identified by the “and/or” clause, whether related or unrelated to those elements specifically identified. Thus, as a non-limiting example, a reference to “A and/or B”, when used in conjunction with open-ended language such as “comprising” can refer, in one embodiment, to A only (optionally including elements other than B); in another embodiment, to B only (optionally including elements other than A); in yet another embodiment, to both A and B (optionally including other elements); etc.

As used herein in the specification and in the claims, “or” should be understood to have the same meaning as “and/or” as defined above. For example, when separating items in a list, “or” or “and/or” shall be interpreted as being inclusive, i.e., the inclusion of at least one, but also including more than one, of a number or list of elements, and, optionally, additional unlisted items. Only terms clearly indicated to the contrary, such as “only one of or “exactly one of,” or, when used in the claims, “consisting of,” will refer to the inclusion of exactly one element of a number or list of elements. In general, the term “or” as used herein shall only be interpreted as indicating exclusive alternatives (i.e. “one or the other but not both”) when preceded by terms of exclusivity, such as “either,” “one of,” “only one of,” or “exactly one of” “Consisting essentially of,” when used in the claims, shall have its ordinary meaning as used in the field of patent law.

As used herein in the specification and in the claims, the phrase “at least one,” in reference to a list of one or more elements, should be understood to mean at least one element selected from any one or more of the elements in the list of elements, but not necessarily including at least one of each and every element specifically listed within the list of elements and not excluding any combinations of elements in the list of elements. This definition also allows that elements may optionally be present other than the elements specifically identified within the list of elements to which the phrase “at least one” refers, whether related or unrelated to those elements specifically identified. Thus, as a non-limiting example, “at least one of A and B” (or, equivalently, “at least one of A or B,” or, equivalently “at least one of A and/or B”) can refer, in one embodiment, to at least one, optionally including more than one, A, with no B present (and optionally including elements other than B); in another embodiment, to at least one, optionally including more than one, B, with no A present (and optionally including elements other than A); in yet another embodiment, to at least one, optionally including more than one, A, and at least one, optionally including more than one, B (and optionally including other elements); etc.

In the claims, as well as in the specification above, all transitional phrases such as “comprising,” “including,” “carrying,” “having,” “containing,” “involving,” “holding,” “composed of,” and the like are to be understood to be open-ended, i.e., to mean including but not limited to. Only the transitional phrases “consisting of” and “consisting essentially of” shall be closed or semi-closed transitional phrases, respectively, as set forth in the United States Patent Office Manual of Patent Examining Procedures, Section 2111.03. 

What is claimed is:
 1. A communication device, comprising: an antenna; a receiver configured to: receive, from the antenna, signals representative of data that has been two-dimensionally spread and transmitted over a communication channel; process the signals to determine equalization coefficients based upon a two-dimensional time-frequency impulse response of the communication channel; and perform a two-dimensional signal equalization procedure using the equalization coefficients.
 2. The communication device of claim 1 wherein the equalization coefficients include a plurality of feedforward equalization coefficients and a plurality of feedback equalization coefficients.
 3. The communication device of claim 1 further including a transmitter configured to: receive a stream of input data; generate two-dimensionally pre-equalized data; transmit the pre-equalized data.
 4. The communication device of claim 3 wherein the transmitter is further configured to generate the two-dimensionally pre-equalized data by pre-equalizing the input data in accordance with corrective information relating to echo reflections and frequency shifts present within a communication channel.
 5. A method of receiving communication signals, the method comprising: receiving signals representative of data that has been two-dimensionally spread and transmitted over a communication channel; processing the signals to determine equalization coefficients based upon a two-dimensional time-frequency impulse response of the communication channel; and performing a two-dimensional signal equalization procedure using the equalization coefficients.
 6. The method of claim 5 wherein the equalization coefficients include a plurality of feedforward equalization coefficients and a plurality of feedback equalization coefficients.
 7. The method of claim 5 further including: receiving a stream of input data; generating two-dimensionally pre-equalized data; transmitting the pre-equalized data.
 8. The method of claim 7 wherein the generating includes pre-equalizing the input data in accordance with corrective information relating to echo reflections and frequency shifts present within the communication channel.
 9. A communication device, comprising: an antenna arrangement; and a transmitter configured to: receive a stream of input data; generate two-dimensionally pre-equalized data by pre-equalizing the input data in accordance with corrective information relating to echo reflections and frequency shifts present within a communication channel; transmit the pre-equalized data.
 10. The communication device of claim 9 further including a receiver configured to receive, from the antenna, signals representative of data that has been two-dimensionally spread and transmitted over the communication channel.
 11. A communication device, comprising: an antenna; a receiver configured to: receive, from the antenna, signals representative of data that has been two-dimensionally spread and transmitted over a communication channel; process the signals to determine equalization coefficients based upon a two-dimensional time-frequency impulse response of the communication channel; and perform a two-dimensional signal equalization procedure using the equalization coefficients.
 12. A method of receiving communication signals, the method comprising: receiving signals representative of data that has been two-dimensionally spread and transmitted over a communication channel; processing the signals to determine equalization coefficients based upon a two-dimensional time-frequency impulse response of the communication channel; and performing a two-dimensional signal equalization procedure using the equalization coefficients.
 13. The method of claim 12 wherein the equalization coefficients include a plurality of feedforward equalization coefficients and a plurality of feedback equalization coefficients.
 14. A method of providing a modulated signal useable in a signal transmission system, the method comprising: transforming a data frame including a plurality of data elements into a two-dimensionally spread data matrix by performing a spreading operation wherein the spread data matrix includes at least N rows and at least M columns, where N and are greater than one; filtering each of the at least N rows of the spread data matrix using a filter bank, and generating the modulated signal in accordance with results of the filtering.
 15. The method of claim 14 wherein the transforming includes spreading the plurality of data elements by performing a two-dimensional cyclic convolution using a spreading kernel.
 16. The method of claim 14 wherein the transforming further includes performing a convolution implemented using a two-dimensional FFT.
 17. The method of claim 14 wherein the transforming includes performing an FFT operation with respect to the plurality of data elements and multiplying a result of the FFT operation in accordance with a Fourier mask. 